Equitable defective coloring of sparse planar graphs

DOI10.1016/J.DISC.2011.10.024MaRDI QIDQ764883zbMATH OpenOpenAlexFDO

Authors Lee Williams, Jennifer Vandenbussche, Gexin Yu

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)

Recommendations

• Equitable coloring of sparse planar graphs
• Equitable defective colorings of complete bipartite graphs
• Equitable coloring planar graphs with large girth
• On the equitable edge-coloring of 1-planar graphs and planar graphs
• Equitable coloring of planar graphs without 4-and 5-cycles

Cites work

• scientific article; zbMATH DE number 1046311 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 1833421 (Why is no real title available?)
• scientific article; zbMATH DE number 871903 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• An existential problem of a weight-controlled subset and its application to school timetable construction
• Defective coloring revisited
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Equitable Colourings of d-degenerate Graphs
• Equitable coloring and the maximum degree
• Equitable coloring of sparse planar graphs
• Equitable coloring planar graphs with large girth
• Mutual exclusion scheduling
• On \((3,1)^*\)-coloring of plane graphs
• On equitable \(\Delta\)-coloring of graphs with low average degree
• On equitable coloring of bipartite graphs
• Ore-type versions of Brooks' theorem
• Perfect Graphs and an Application to Optimizing Municipal Services
• Planar graphs are 1-relaxed, 4-choosable

Cited in

(4)

• Relaxed equitable colorings of planar graphs with girth at least 8
• Equitable defective colorings of complete bipartite graphs
• Equitable cluster partition of planar graphs with girth at least 12
• 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)