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

← Older edit

@@ description / en / description / en @@
+scientific article; zbMATH DE number 7117440
@@ Property / zbMATH Open document ID @@
+.05056
@@ Property / zbMATH Open document ID: 1434.05056 / rank @@
+Normal rank
@@ Property / DOI @@
+.1137/1.9781611975482.91
@@ Property / DOI: 10.1137/1.9781611975482.91 / rank @@
+Normal rank
@@ Property / published in @@
+Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
+Normal rank
@@ Property / publication date @@
+October 2019Timestamp +2019-10-15T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2019-10-15T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 15 October 2019 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C42
@@ Property / Mathematics Subject Classification ID: 05C42 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+7117440
@@ 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 @@
+W2952588660
@@ Property / OpenAlex ID: W2952588660 / rank @@
+Normal rank
@@ Property / cites work @@
+Object location using path separators
@@ Property / cites work: Object location using path separators / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Subexponential Time Algorithms for Embedding H-Minor Free Graphs
+Normal rank
@@ Property / cites work @@
+Improved bounds for centered colorings
@@ Property / cites work: Improved bounds for centered colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Contraction decomposition in h-minor-free graphs and algorithmic applications
+Normal rank
@@ Property / cites work @@
+Approximation algorithms via contraction decomposition
+Normal rank
@@ Property / cites work @@
+Excluding any graph as a minor allows a low tree-width 2-coloring
+Normal rank
@@ Property / cites work @@
+Planar Subgraph Isomorphism Revisited
@@ Property / cites work: Planar Subgraph Isomorphism Revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Testing first-order properties for subclasses of sparse graphs
+Normal rank
@@ Property / cites work @@
+Subgraph Isomorphism in Planar Graphs and Related Problems
+Normal rank
@@ Property / cites work @@
+Optimally cutting a surface into a disk
@@ Property / cites work: Optimally cutting a surface into a disk / rank @@
+Normal rank
@@ Property / cites work @@
+First-Order Interpretations of Bounded Expansion Classes
+Normal rank
@@ Property / cites work @@
+Local tree-width, excluded minors, and approximation algorithms
+Normal rank
@@ Property / cites work @@
+A Simple Algorithm for the Graph Minor Decomposition − Logic meets Structural Graph Theory–
+Normal rank
@@ Property / cites work @@
+Q3118384
@@ Property / cites work: Q3118384 / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring and Covering Nowhere Dense Graphs
@@ Property / cites work: Coloring and Covering Nowhere Dense Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A simpler algorithm and shorter proof for the graph minor decomposition
+Normal rank
@@ Property / cites work @@
+Orderings on graphs and game coloring number
@@ Property / cites work: Orderings on graphs and game coloring number / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4231923
@@ Property / cites work: Q4231923 / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-depth, subgraph coloring and homomorphism bounds
+Normal rank
@@ Property / cites work @@
+Grad and classes with bounded expansion. I: Decompositions
+Normal rank
@@ Property / cites work @@
+On nowhere dense graphs
@@ Property / cites work: On nowhere dense graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial bounds for centered colorings on proper minor-closed graph classes
+Normal rank
@@ Property / cites work @@
+Parameterized circuit complexity of model-checking on sparse structures
+Normal rank
@@ Property / cites work @@
+On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs
+Normal rank
@@ Property / cites work @@
+Graph minors. XVI: Excluding a non-planar graph
@@ Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+On the generalised colouring numbers of graphs that exclude a fixed minor
+Normal rank
@@ Property / cites work @@
+Colouring graphs with bounded generalized colouring number
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1984513