Three-coloring graphs embedded on surfaces with all faces even-sided (Q1898734): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jctb.1995.1047 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1990994902 / rank | |||
Normal rank | |||
Revision as of 17:42, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Three-coloring graphs embedded on surfaces with all faces even-sided |
scientific article |
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
