Relaxed equitable colorings of planar graphs with girth at least 8
From MaRDI portal
Publication:2305904
DOI10.1016/j.disc.2019.111790zbMath1435.05079OpenAlexW2999940823WikidataQ126359232 ScholiaQ126359232MaRDI QIDQ2305904
Publication date: 20 March 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.111790
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable ⋮ List injective coloring of planar graphs ⋮ SOME EXTREMAL RESULTS ON THE CHROMATIC STABILITY INDEX
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
- Equitable defective coloring of sparse planar graphs
- Planar graphs are 1-relaxed, 4-choosable
- Extremal results on defective colorings of graphs
- Relaxed coloring of a graph
- A note on relaxed equitable coloring of graphs
- Limits of Near-Coloring of Sparse Graphs
- Equitable Coloring of Sparse Planar Graphs
- Defective coloring revisited
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- EQUITABLE DEFECTIVE COLORINGS OF COMPLETE BIPARTITE GRAPHS
- On $(3,1)^*$-Coloring of Plane Graphs