Publication:1984513: Difference between revisions
Created automatically from import240129110113 |
EloiFerrer (talk | contribs) m EloiFerrer moved page Polynomial bounds for centered colorings on proper minor-closed graph classes to Polynomial bounds for centered colorings on proper minor-closed graph classes: Duplicate |
(No difference)
| |
Latest revision as of 15:07, 2 May 2024
DOI10.1016/j.jctb.2021.06.002zbMath1490.05082arXiv1807.03683MaRDI QIDQ1984513
Michał Pilipczuk, Sebastian Siebertz
Publication date: 16 September 2021
Published in: Journal of Combinatorial Theory. Series B, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.03683
subgraph isomorphism; sparse graphs; structural graph theory; centered colorings; \(K_t\)-minor-free graph
05C75: Structural characterization of families of graphs
05C15: Coloring of graphs and hypergraphs
05C83: Graph minors
05C85: Graph algorithms (graph-theoretic aspects)
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
05C42: Density (toughness, etc.)
