Vertex partitions of \((C_3, C_4, C_6)\)-free planar graphs
From MaRDI portal
Publication:2324512
DOI10.1016/j.disc.2019.07.002zbMath1419.05053arXiv1711.08710OpenAlexW2962069143MaRDI QIDQ2324512
Publication date: 11 September 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.08710
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
- Near-colorings: non-colorable graphs and NP-completeness
- Defective 2-colorings of sparse graphs
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs
- A Complexity Dichotomy for the Coloring of Sparse Graphs