Injective choosability of planar graphs of girth five and six

DOI10.1016/j.disc.2011.10.029zbMath1238.05093WikidataQ114190764 ScholiaQ114190764MaRDI QIDQ409477

Rui Li, Bao-Gang Xu

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

zbMATH Keywords

planar graphs; girth; maximum average degree; injective coloring

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

Related Items

List injective coloring of a class of planar graphs without short cycles, Unnamed Item, LIST INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH g ≥ 5, Injective coloring of planar graphs, Injective coloring of planar graphs with girth 6, Injective coloring of plane graphs with girth 5, List injective coloring of planar graphs with girth \(g \geq 6\), Injective choosability of subcubic planar graphs with girth 6, Connectivity of minimum non-5-injectively colorable planar cubic graphs, Two smaller upper bounds of List injective chromatic number, List injective coloring of planar graphs with girth 5, 6, 8

Cites Work

• Unnamed Item
• Unnamed Item
• Injective colorings of graphs with low average degree
• List injective colorings of planar graphs
• Injective colorings of sparse graphs
• Some bounds on the injective chromatic number of graphs
• List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
• Injective colorings of planar graphs with few colors
• 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
• On the injective chromatic number of graphs
• Injective coloring of planar graphs