Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513): Difference between revisions

From MaRDI portal
Page on [mardi] deleted: Publication:1984513
Merged Item from Q5236275
description / endescription / en
 
scientific article; zbMATH DE number 7117440
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1434.05056 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1137/1.9781611975482.91 / rank
 
Normal rank
Property / published in
 
Property / published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms / rank
 
Normal rank
Property / publication date
 
15 October 2019
Timestamp+2019-10-15T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 15 October 2019 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C42 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7117440 / rank
 
Normal rank
Property / zbMATH Keywords
 
sparse graphs
Property / zbMATH Keywords: sparse graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
\(K_t\)-minor-free graph
Property / zbMATH Keywords: \(K_t\)-minor-free graph / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2952588660 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 08:33, 6 May 2024

scientific article; zbMATH DE number 7117440
Language Label Description Also known as
English
Polynomial bounds for centered colorings on proper minor-closed graph classes
scientific article; zbMATH DE number 7117440

    Statements

    Polynomial bounds for centered colorings on proper minor-closed graph classes (English)
    0 references
    0 references
    0 references
    16 September 2021
    0 references
    15 October 2019
    0 references
    structural graph theory
    0 references
    centered colorings
    0 references
    subgraph isomorphism
    0 references
    sparse graphs
    0 references
    \(K_t\)-minor-free graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references