The number of defective colorings of graphs on surfaces
From MaRDI portal
Publication:3174242
DOI10.1002/JGT.20546zbMATH Open1230.05134OpenAlexW1977152867MaRDI QIDQ3174242FDOQ3174242
Authors: 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
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- The four-colour theorem
- Exponentially many 5-list-colorings of planar graphs
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- A theorem on graphs
- A Theorem on Planar Graphs
- Trees in triangulations
- Disjoint paths, planarizing cycles, and spanning walks
- You can't paint yourself into a corner
- Trees in Polyhedral Graphs
- On spanning trees and walks of low maximum degree
- Spanning planar subgraphs of graphs in the torus and Klein bottle
- A 1-tough nonhamiltonian maximal planar graph
- Title not available (Why is that?)
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
Cited In (5)
- Graph partitions under average degree constraint
- The number of \(k\)-colorings of a graph on a fixed surface
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- A note on defective colorings of graphs in surfaces
- Estimating the minimal number of colors in acyclic \(k\)-strong colorings of maps on surfaces
This page was built for publication: The number of defective colorings of graphs on surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174242)
