The number of defective colorings of graphs on surfaces

DOI10.1002/jgt.20546zbMath1230.05134OpenAlexW1977152867MaRDI QIDQ3174242

Tom Rackham

Publication date: 12 October 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20546

zbMATH Keywords

graph coloringplanar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Graph partitions under average degree constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Exponentially many 5-list-colorings of planar graphs
• A 1-tough nonhamiltonian maximal planar graph
• You can't paint yourself into a corner
• Trees in triangulations
• The four-colour theorem
• A theorem on graphs
• Spanning planar subgraphs of graphs in the torus and Klein bottle
• Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
• Disjoint paths, planarizing cycles, and spanning walks
• A Theorem on Planar Graphs
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Trees in Polyhedral Graphs
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM

This page was built for publication: The number of defective colorings of graphs on surfaces