Improved bounds for centered colorings

DOI10.1137/1.9781611975994.136OpenAlexW3194359700MaRDI QIDQ5146925

Stefan Felsner, Felix Schröder, Piotr Micek, Michał Dębski

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975994.136

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (10)

Clustered 3-colouring graphs of bounded degree ⋮ A fast algorithm for the product structure of planar graphs ⋮ Two lower bounds for $p$-centered colorings ⋮ A \(p\)-centered coloring for the grid using \(O(p)\) colors ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Bounds on half graph orders in powers of sparse graphs ⋮ Two Results on Layered Pathwidth and Linear Layouts ⋮ Polynomial bounds for centered colorings on proper minor-closed graph classes ⋮ Improved Bounds for Centered Colorings ⋮ Notes on graph product structure theory

This page was built for publication: Improved bounds for centered colorings