Equitable defective coloring of sparse planar graphs
From MaRDI portal
Publication:764883
DOI10.1016/j.disc.2011.10.024zbMath1237.05088OpenAlexW1965266443MaRDI QIDQ764883
Gexin Yu, Lee Williams, Jennifer Vandenbussche
Publication date: 16 March 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.10.024
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)
Related Items (2)
Equitable partition of planar graphs ⋮ Relaxed equitable colorings of planar graphs with girth at least 8
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On equitable \(\Delta\)-coloring of graphs with low average degree
- Planar graphs are 1-relaxed, 4-choosable
- Ore-type versions of Brooks' theorem
- An existential problem of a weight-controlled subset and its application to school timetable construction
- Equitable coloring and the maximum degree
- Mutual exclusion scheduling
- On equitable coloring of bipartite graphs
- Equitable coloring planar graphs with large girth
- Equitable Coloring of Sparse Planar Graphs
- Defective coloring revisited
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Equitable Colourings of d-degenerate Graphs
- On $(3,1)^*$-Coloring of Plane Graphs
- Perfect Graphs and an Application to Optimizing Municipal Services
This page was built for publication: Equitable defective coloring of sparse planar graphs
