On the public citation graph

Improved Bounds for Centered Colorings

0 signed · 47 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.20029openalex-snapshot
Star coloring of graphs
inferredcites →https://doi.org/10.1007/s00453-020-00760-0openalex-snapshot
Polynomial Treedepth Bounds in Linear Colorings
inferredcites →https://doi.org/10.1007/s00453-020-00793-5openalex-snapshot
A Fast Algorithm for the Product Structure of Planar Graphs
inferredcites →https://doi.org/10.1016/j.disc.2007.08.043openalex-snapshot
Nonrepetitive colorings of graphs of bounded tree-width
inferredcites →https://doi.org/10.1016/j.ejc.2005.01.010openalex-snapshot
Tree-depth, subgraph coloring and homomorphism bounds
inferredcites →https://doi.org/10.1016/j.ejc.2006.07.013openalex-snapshot
Grad and classes with bounded expansion I. Decompositions
inferredcites →https://doi.org/10.1016/j.ejc.2011.01.006openalex-snapshot
On nowhere dense graphs
inferredcites →https://doi.org/10.1016/j.ejc.2011.09.008openalex-snapshot
Characterisations and examples of graph classes with bounded expansion
inferredcites →https://doi.org/10.1016/s0095-8956(03)00042-xopenalex-snapshot
Graph Minors. XVI. Excluding a non-planar graph
inferredcites →https://doi.org/10.1109/focs.2019.00056openalex-snapshot
Planar Graphs have Bounded Queue-Number
inferredcites →https://doi.org/10.1137/1.9781611975482.91openalex-snapshot
Polynomial bounds for centered colorings on proper minor-closed graph classes
inferredcites →https://doi.org/10.1137/1.9781611975994.136openalex-snapshot
Improved bounds for centered colorings
inferredcites →https://doi.org/10.1137/120892234openalex-snapshot
Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
inferredcites →https://doi.org/10.1137/s0097539702416141openalex-snapshot
Layout of Graphs with Bounded Tree-Width
inferredcites →https://doi.org/10.1145/1667053.1667060openalex-snapshot
A constructive proof of the general lovász local lemma
inferredcites →https://doi.org/10.1145/2499483openalex-snapshot
Testing first-order properties for subclasses of sparse graphs
inferredcites →https://doi.org/10.1145/3154856openalex-snapshot
On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs
inferredcites →https://doi.org/10.37236/10274openalex-snapshot
Improved Bounds for Weak Coloring Numbers
inferredcites →https://doi.org/10.48550/arxiv.1210.8113openalex-snapshot
A note on planar partial 3-trees
inferredcites →https://doi.org/10.48550/arxiv.1712.06690openalex-snapshot
An Experimental Evaluation of a Bounded Expansion Algorithmic Pipeline
inferredcites →https://doi.org/10.5555/3310435.3310526openalex-snapshot
Polynomial bounds for centered colorings on proper minor-closed graph classes

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.22827openalex-snapshot
Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings
inferred← citeshttps://doi.org/10.1002/jgt.23008openalex-snapshot
The product structure of squaregraphs
inferred← citeshttps://doi.org/10.1002/jgt.23023openalex-snapshot
Structural properties of graph products
inferred← citeshttps://doi.org/10.1007/978-3-031-47417-0_9openalex-snapshot
Product Structure of Graph Classes with Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/s00493-025-00168-wopenalex-snapshot
The Grid-Minor Theorem Revisited
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114697openalex-snapshot
The r-dynamic chromatic number is bounded in the strong 2-coloring number
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.06.002openalex-snapshot
Polynomial bounds for centered colorings on proper minor-closed graph classes
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.03.004openalex-snapshot
Graph product structure for non-minor-closed classes
inferred← citeshttps://doi.org/10.1017/s0963548323000457openalex-snapshot
Product structure of graph classes with bounded treewidth
inferred← citeshttps://doi.org/10.1090/btran/192openalex-snapshot
Product structure of graphs with an excluded minor
inferred← citeshttps://doi.org/10.1109/focs.2019.00056openalex-snapshot
Planar Graphs have Bounded Queue-Number
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00116openalex-snapshot
Proof of the Clustered Hadwiger Conjecture
inferred← citeshttps://doi.org/10.1137/1.9781611975994.136openalex-snapshot
Improved bounds for centered colorings
inferred← citeshttps://doi.org/10.1137/22m1540296openalex-snapshot
Shallow Minors, Graph Products, and Beyond-Planar Graphs
inferred← citeshttps://doi.org/10.22215/etd/2023-15707openalex-snapshot
Graph Colouring and Decomposition
inferred← citeshttps://doi.org/10.23638/dmtcs-22-4-9openalex-snapshot
Two lower bounds for $p$-centered colorings
inferred← citeshttps://doi.org/10.37236/10274openalex-snapshot
Improved Bounds for Weak Coloring Numbers
inferred← citeshttps://doi.org/10.37236/10614openalex-snapshot
An Improved Planar Graph Product Structure Theorem
inferred← citeshttps://doi.org/10.37236/11063openalex-snapshot
Bounds on Half Graph Orders in Powers of Sparse Graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.7458openalex-snapshot
Separating layered treewidth and row treewidth
inferred← citeshttps://doi.org/10.46298/dmtcs.8877openalex-snapshot
Improved product structure for graphs on surfaces
inferred← citeshttps://doi.org/10.48550/arxiv.2008.00775openalex-snapshot
A general framework for hypergraph colouring
inferred← citeshttps://doi.org/10.48550/arxiv.2109.00327openalex-snapshot
Universality in minor-closed graph classes
inferred← citeshttps://doi.org/10.5802/igt.10openalex-snapshot
Product Structure of Graph Classes with Strongly Sublinear Separators
inferred← citeshttps://doi.org/10.5802/igt.4openalex-snapshot
Powers of planar graphs, product structure, and blocking partitions
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-049openalex-snapshot
Powers of planar graphs, product structure, and blocking partitions
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.