The number of defective colorings of graphs on surfaces
From MaRDI portal
Publication:3174242
Recommendations
Cites work
- scientific article; zbMATH DE number 1536530 (Why is no real title available?)
- A 1-tough nonhamiltonian maximal planar graph
- A Theorem on Planar Graphs
- A theorem on graphs
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Disjoint paths, planarizing cycles, and spanning walks
- Exponentially many 5-list-colorings of planar graphs
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
- On spanning trees and walks of low maximum degree
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Spanning planar subgraphs of graphs in the torus and Klein bottle
- The four-colour theorem
- Trees in Polyhedral Graphs
- Trees in triangulations
- You can't paint yourself into a corner
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)