Injective coloring of planar graphs with girth 6
From MaRDI portal
Publication:389479
DOI10.1016/j.disc.2013.02.014zbMath1279.05025WikidataQ114190743 ScholiaQ114190743MaRDI QIDQ389479
Publication date: 20 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.02.014
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Unnamed Item, Unnamed Item, List injective coloring of planar graphs with disjoint 5−-cycles, Injective coloring of planar graphs, Unnamed Item, List injective coloring of planar graphs, 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4, Injective \(\Delta +2\) coloring of planar graph without short cycles, Injective coloring of plane graphs with girth 5, List injective coloring of planar graphs with girth \(g \geq 6\), 2-distance coloring of planar graphs with girth 5, Injective chromatic number of outerplanar graphs, Injective choosability of subcubic planar graphs with girth 6, Injective coloring of Halin graphs, Injective coloring of planar graphs with girth 5, List injective coloring of planar graphs, Sharp upper bound of injective coloring of planar graphs with girth at least 5, Connectivity of minimum non-5-injectively colorable planar cubic graphs
Cites Work
- Injective choosability of planar graphs of girth five and six
- Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6
- Some bounds on the injective chromatic number of graphs
- Injective colorings of planar graphs with few colors
- On the injective chromatic number of graphs
- Some results on the injective chromatic number of graphs
- Injective coloring of planar graphs