2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles
From MaRDI portal
Publication:5232154
DOI10.1137/17M1157313zbMath1426.05041OpenAlexW2963895478WikidataQ127460821 ScholiaQ127460821MaRDI QIDQ5232154
Publication date: 29 August 2019
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1157313
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
Degeneracy and colorings of squares of planar graphs without 4-cycles ⋮ Coloring squares of planar graphs with maximum degree at most five ⋮ On \(L (p, q)\)-labelling of planar graphs without cycles of length four
Cites Work
- Unnamed Item
- An improved bound on 2-distance coloring plane graphs with girth 5
- On 2-distance coloring of plane graphs with girth 5
- The \(L(p, q)\)-labelling of planar graphs without 4-cycles
- Labelling planar graphs without 4-cycles with a condition on distance two
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
- Planar graphs of girth at least five are square \((\delta + 2)\)-choosable
- 2-distance coloring of planar graphs with girth 5
- The square of a planar cubic graph is 7-colorable
- An optimal square coloring of planar graphs
- Coloring squares of planar graphs with girth six
- A bound on the chromatic number of the square of a planar graph
- Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
- 2-distance coloring of sparse planar graphs
- Coloring Powers of Planar Graphs
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- Coloring the square of a planar graph
- List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles
This page was built for publication: 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles
