A \(p\)-centered coloring for the grid using \(O(p)\) colors

DOI10.1016/j.disc.2023.113670zbMath1525.05048arXiv2207.11496OpenAlexW4386300692MaRDI QIDQ6080129

Mathew C. Francis, Drimit Pattanayak

Publication date: 30 October 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.11496

zbMATH Keywords

planar grid\(p\)-centered coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Excluding any graph as a minor allows a low tree-width 2-coloring
• Polynomial bounds for centered colorings on proper minor-closed graph classes
• Grad and classes with bounded expansion. I: Decompositions
• Tree-depth, subgraph coloring and homomorphism bounds
• Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
• Improved bounds for centered colorings

This page was built for publication: A \(p\)-centered coloring for the grid using \(O(p)\) colors