List injective coloring of planar graphs with disjoint 5−-cycles
From MaRDI portal
Publication:5083875
DOI10.1142/S1793830921501482zbMath1489.05055OpenAlexW3176607271WikidataQ114071641 ScholiaQ114071641MaRDI QIDQ5083875
Publication date: 21 June 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921501482
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Injective coloring of planar graphs with girth 6
- Injective coloring of plane graphs with girth 5
- List injective colorings of planar graphs
- List injective coloring of planar graphs with girth \(g \geq 6\)
- Some bounds on the injective chromatic number of graphs
- Injective colorings of planar graphs with few colors
- List \(r\)-dynamic coloring of graphs with small maximum average degree
- On the injective chromatic number of graphs
- Some results on the injective chromatic number of graphs
- The list \(L(2,1)\)-labeling of planar graphs with large girth
- A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles
- List injective coloring of a class of planar graphs without short cycles
- Injective coloring of planar graphs
This page was built for publication: List injective coloring of planar graphs with disjoint 5−-cycles