Injective choosability of planar graphs of girth five and six
From MaRDI portal
Publication:409477
DOI10.1016/J.DISC.2011.10.029zbMATH Open1238.05093OpenAlexW2090778132WikidataQ114190764 ScholiaQ114190764MaRDI QIDQ409477FDOQ409477
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.10.029
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Graph theory
- List injective colorings of planar graphs
- 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
- Injective colorings of planar graphs with few colors
- On the injective chromatic number of graphs
- Injective coloring of planar graphs
- Some bounds on the injective chromatic number of graphs
- List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
- Title not available (Why is that?)
- Injective colorings of graphs with low average degree
- Injective colorings of sparse graphs
Cited In (16)
- List injective coloring of planar graphs with girth \(g \geq 6\)
- Injective choosability of subcubic planar graphs with girth 6
- Injective coloring of planar graphs with girth 5
- LIST INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH g ≥ 5
- Injective coloring of plane graphs with girth 5
- List injective coloring of planar graphs with girth 5, 6, 8
- Title not available (Why is that?)
- Injective coloring of Halin graphs
- Injective coloring of planar graphs
- Two smaller upper bounds of List injective chromatic number
- Title not available (Why is that?)
- Planar graphs of girth at least five are square \((\delta + 2)\)-choosable
- Connectivity of minimum non-5-injectively colorable planar cubic graphs
- List injective coloring of planar graphs
- List injective coloring of a class of planar graphs without short cycles
- Injective coloring of planar graphs with girth 6
This page was built for publication: Injective choosability of planar graphs of girth five and six
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409477)