Injective coloring of planar graphs
From MaRDI portal
The authors prove that for a Halin graph \(G\), \(\chi_{i}(G) \leq \Delta (G)+2\), \(\chi_{i}(G) \leq \Delta (G)+1\) if \(\Delta(G) \geq 6\) and for a triangle-free planer graph \(G\) without intersecting \(4\) cycles, \(\chi_{i}(G) \leq \Delta (G)+6\) if \(\Delta (G)\geq 6 \).
Recommendations
Cites work
- Injective \((\Delta + 1)\)-coloring of planar graphs with girth 6
- Injective choosability of planar graphs of girth five and six
- Injective coloring of Halin graphs
- Injective coloring of planar graphs with girth 6
- Injective coloring of plane graphs with girth 5
- Injective colorings of graphs with low average degree
- Injective colorings of planar graphs with few colors
- List injective coloring of planar graphs with girth 5, 6, 8
- List injective coloring of planar graphs with girth g 6
- List injective colorings of planar graphs
- On the injective chromatic number of graphs
- Some bounds on the injective chromatic number of graphs
- Two smaller upper bounds of List injective chromatic number
Cited in
(13)- Some results on the injective chromatic number of graphs
- Injective coloring of Halin graphs
- List injective coloring of planar graphs
- Sharp upper bound of injective coloring of planar graphs with girth at least 5
- Locally injective k-colourings of planar graphs
- scientific article; zbMATH DE number 7318748 (Why is no real title available?)
- Injective coloring of complementary prism and generalized complementary prism graphs
- List injective coloring of planar graphs with disjoint 5^--cycles
- scientific article; zbMATH DE number 7235309 (Why is no real title available?)
- List injective coloring of planar graphs
- Injectively \(k\)-colored rooted forests
- Injective coloring of generalized Mycielskian of graphs
- Injective colorings with arithmetic constraints
This page was built for publication: Injective coloring of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919062)
