List injective coloring of a class of planar graphs without short cycles
From MaRDI portal
Publication:4554555
DOI10.1142/S1793830918500684zbMath1400.05080WikidataQ114071644 ScholiaQ114071644MaRDI QIDQ4554555
Publication date: 14 November 2018
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
List injective coloring of planar graphs ⋮ List injective coloring of planar graphs with disjoint 5−-cycles ⋮ 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4 ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Injective choosability of planar graphs of girth five and six
- Injective colorings of graphs with low average degree
- Some bounds on the injective chromatic number of graphs
- On the injective chromatic number of graphs
- LIST INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH g ≥ 5
- Injective coloring of planar graphs
This page was built for publication: List injective coloring of a class of planar graphs without short cycles