Injective choosability of subcubic planar graphs with girth 6
From MaRDI portal
Publication:2012551
DOI10.1016/j.disc.2017.05.014zbMath1367.05046arXiv1611.03454OpenAlexW2554231113WikidataQ114190713 ScholiaQ114190713MaRDI QIDQ2012551
Shanise Walker, Kacy Messerschmidt, Robert Lazar, Jennifer Edmond, Bernard Lidický, Boris Brimkov
Publication date: 1 August 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.03454
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (2)
Exact square coloring of subcubic planar graphs ⋮ 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4
Cites Work
- Unnamed Item
- Unnamed Item
- Injective coloring of planar graphs with girth 6
- Injective choosability of planar graphs of girth five and six
- An introduction to the discharging method via graph coloring
- Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6
- Injective colorings of graphs with low average degree
- Injective colorings of sparse graphs
- List injective coloring of planar graphs with girth \(g \geq 6\)
- Some bounds on the injective chromatic number of graphs
- Injective colorings of planar graphs with few colors
- Colorings and orientations of graphs
- On the injective chromatic number of graphs
- Some results on the injective chromatic number of graphs
- List injective coloring of planar graphs with girth 5, 6, 8
- Injective coloring of planar graphs
This page was built for publication: Injective choosability of subcubic planar graphs with girth 6
