Connectivity of minimum non-5-injectively colorable planar cubic graphs
From MaRDI portal
Publication:2176826
DOI10.1007/s40305-018-0214-6zbMath1449.05100OpenAlexW2886427884MaRDI QIDQ2176826
Publication date: 5 May 2020
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-018-0214-6
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Cites Work
- On the complexity of injective colorings and its generalizations
- Injective coloring of planar graphs with girth 6
- Injective choosability of planar graphs of girth five and six
- 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
- Injective colorings of planar graphs with few colors
- The square of a planar cubic graph is 7-colorable
- On the injective chromatic number of graphs
- Some results on the injective chromatic number of graphs
- Two smaller upper bounds of List injective chromatic number
- List injective coloring of planar graphs with girth 5, 6, 8
- Counterexamples to a conjecture on injective colorings
- List-coloring the square of a subcubic graph
- On Injective Colourings of Chordal Graphs
- Some Theorems on Abstract Graphs
- Injective coloring of planar graphs
This page was built for publication: Connectivity of minimum non-5-injectively colorable planar cubic graphs
