Equitable defective coloring of sparse planar graphs

DOI10.1016/J.DISC.2011.10.024zbMATH Open1237.05088OpenAlexW1965266443MaRDI QIDQ764883FDOQ764883

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

zbMATH Keywords

equitable coloringgirthplanar graphcoloringdefective coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ore-type versions of Brooks' theorem
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Planar graphs are 1-relaxed, 4-choosable
• Equitable coloring and the maximum degree
• On equitable coloring of bipartite graphs
• An existential problem of a weight-controlled subset and its application to school timetable construction
• Mutual exclusion scheduling
• On $(3,1)^*$-Coloring of Plane Graphs
• Perfect Graphs and an Application to Optimizing Municipal Services
• Defective coloring revisited
• Equitable coloring planar graphs with large girth
• Equitable Colourings of d-degenerate Graphs
• On equitable \(\Delta\)-coloring of graphs with low average degree
• Equitable Coloring of Sparse Planar Graphs

Cited In (3)

• Equitable cluster partition of planar graphs with girth at least 12
• Relaxed equitable colorings of planar graphs with girth at least 8
• Equitable partition of planar graphs

This page was built for publication: Equitable defective coloring of sparse planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764883)