Two smaller upper bounds of List injective chromatic number
From MaRDI portal
Publication:2253957
DOI10.1007/s10878-013-9599-7zbMath1338.90424OpenAlexW2066729569WikidataQ114225862 ScholiaQ114225862MaRDI QIDQ2253957
Publication date: 16 February 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-013-9599-7
Related Items
Connectivity of minimum non-5-injectively colorable planar cubic graphs ⋮ 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4 ⋮ Injective \(\Delta +2\) coloring of planar graph without short cycles ⋮ Injective coloring of planar graphs ⋮ Injective coloring of Halin graphs
Cites Work
- Unnamed Item
- Injective choosability of planar graphs of girth five and six
- 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
- Some bounds on the injective chromatic number of graphs
- Injective colorings of planar graphs with few colors
- On the injective chromatic number of graphs
- Some results on the injective chromatic number of graphs
- ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE
- INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH 7
- NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
- Injective coloring of planar graphs
This page was built for publication: Two smaller upper bounds of List injective chromatic number