Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6
From MaRDI portal
Publication:536624
DOI10.1134/S0037446606010034zbMath1272.05043OpenAlexW2064107568WikidataQ114075229 ScholiaQ114075229MaRDI QIDQ536624
Anna O. Ivanova, Oleg V. Borodin
Publication date: 19 May 2011
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0037446606010034
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH 7 ⋮ Sharp upper bound of injective coloring of planar graphs with girth at least 5 ⋮ 2-distance coloring of planar graphs with girth 5 ⋮ Injective coloring of planar graphs with girth 6 ⋮ Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable ⋮ Injective \(\Delta +2\) coloring of planar graph without short cycles ⋮ List injective coloring of planar graphs with girth 5, 6, 8 ⋮ Injective chromatic number of outerplanar graphs ⋮ Injective edge coloring of sparse graphs ⋮ LIST INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH g ≥ 5 ⋮ Two smaller upper bounds of List injective chromatic number ⋮ Injective coloring of planar graphs ⋮ Injective choosability of subcubic planar graphs with girth 6 ⋮ Injective coloring of Halin graphs ⋮ List injective coloring of planar graphs with girth \(g \geq 6\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Injective colorings of sparse 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
- Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6
- Coloring squares of planar graphs with girth six
- A bound on the chromatic number of the square of a planar graph
- Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
- 2-distance coloring of sparse planar graphs
- Coloring Powers of Planar Graphs
- Injective coloring of planar graphs