Three-coloring graphs embedded on surfaces with all faces even-sided (Q1898734)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 798761
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Three-coloring graphs embedded on surfaces with all faces even-sided |
scientific article; zbMATH DE number 798761 |
Statements
Three-coloring graphs embedded on surfaces with all faces even-sided (English)
0 references
20 September 1995
0 references
Every graph embedded on a surface of positive genus with every face bounded by an even number of edges can be 3-colored provided all noncontractible cycles in the graph are sufficiently long. The bound of three colors is the smallest possible for this type of result.
0 references
plane
0 references
planar graphs
0 references
Heawood's bound
0 references
embedding
0 references
torus
0 references
toroidal graph
0 references
graph embedded on a surface
0 references
positive genus
0 references
noncontractible cycles
0 references
bound
0 references
three colors
0 references
0.95240724
0 references
0.91678196
0 references
0.9110911
0 references
0.9068531
0 references
0.9044866
0 references
0.8964944
0 references
0.8956927
0 references
0.8956927
0 references
