2-Distance coloring of planar graphs without triangles and intersecting 4-cycles
From MaRDI portal
Publication:6174168
DOI10.1142/S1793830922500847zbMATH Open1516.05044OpenAlexW4223548091MaRDI QIDQ6174168FDOQ6174168
Authors: Yuehua Bu, Zewei Zhang, Hongguo Zhu 
Publication date: 14 July 2023
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830922500847
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
- 2-distance coloring of planar graphs with girth 5
- A bound on the chromatic number of the square of a planar graph
- Coloring the square of a planar graph
- Planar graphs of girth at least five are square \((\delta + 2)\)-choosable
- List 2-distance coloring of planar graphs without short cycles
- \(2\)-distance coloring of planar graph
- List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles
- 2-distance coloring of sparse planar graphs
Cited In (6)
- 2-distance 4-colorability of planar subcubic graphs with girth at least 22
- 2-Distance coloring of planar graphs without short cycles
- 2-distance coloring of a planar graph without 3, 4, 7-cycles
- \(2\)-distance coloring of planar graph
- 2-distance coloring of planar graphs without 3, 4, 8-cycles
- 2-distance coloring of planar graphs without 4-cycles
This page was built for publication: 2-Distance coloring of planar graphs without triangles and intersecting 4-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174168)
