Sharp upper bound of injective coloring of planar graphs with girth at least 5
From MaRDI portal
Publication:2165276
DOI10.1007/s10878-022-00880-zzbMath1504.05090OpenAlexW4285795925WikidataQ114225855 ScholiaQ114225855MaRDI QIDQ2165276
Publication date: 19 August 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00880-z
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- An improved bound on 2-distance coloring plane graphs with girth 5
- Injective coloring of planar graphs with girth 6
- Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
- Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6
- List injective coloring of planar graphs with girth \(g \geq 6\)
- Injective colorings of planar graphs with few colors
- 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
- On the injective chromatic number of graphs
- 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
- List Colouring Squares of Planar Graphs
- List-coloring the square of a subcubic graph
- Labeling Planar Graphs with Conditions on Girth and Distance Two
- Coloring the square of a planar graph
- LIST INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH g ≥ 5
- Unnamed Item
This page was built for publication: Sharp upper bound of injective coloring of planar graphs with girth at least 5
