Injective colorings of planar graphs with few colors
From MaRDI portal
Publication:1045050
DOI10.1016/j.disc.2008.04.005zbMath1209.05093WikidataQ114190789 ScholiaQ114190789MaRDI QIDQ1045050
Riste Škrekovski, Martin Tancer, Borut Lužar
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.005
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
LIST INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH g ≥ 5, Matrix measure strategies for stabilization and synchronization of delayed BAM neural networks, Injective coloring of planar graphs with girth 6, Injective coloring of plane graphs with girth 5, Injective choosability of planar graphs of girth five and six, Coupon coloring of some special graphs, Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6, Injective colorings of graphs with low average degree, List injective colorings of planar graphs, Injective colorings of sparse graphs, List injective coloring of planar graphs with girth \(g \geq 6\), Nordhaus-Gaddum-type relations of three graph coloring parameters, Graph equation for line graphs and \(m\)-step graphs, Injective choosability of subcubic planar graphs with girth 6, Two smaller upper bounds of List injective chromatic number, On coupon colorings of graphs, List injective coloring of planar graphs with girth 5, 6, 8, INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH 7, On injective chromatic polynomials of graphs
Cites Work
- Unnamed Item
- A note on 2-facial coloring of plane graphs
- Some bounds on the injective chromatic number of graphs
- Distance constrained labelings of planar graphs with no short cycles
- Colorings and orientations of graphs
- On the injective chromatic number of graphs
- Coloring squares of planar graphs with girth six
- A bound on the chromatic number of the square of a planar graph
- 25 pretty graph colouring problems
