Edge colorings of embedded graphs (Q1576578)
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 1491664
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge colorings of embedded graphs |
scientific article; zbMATH DE number 1491664 |
Statements
Edge colorings of embedded graphs (English)
0 references
21 May 2001
0 references
The authors give some conditions for a graph to be embeddable in a surface with Eulerian negative characteristic and to have as chromatic index the maximum degree of its vertices.
0 references
graph
0 references
surface
0 references
embedding
0 references
edge coloring
0 references
chromatic index
0 references
0.8755861520767212
0 references
0.8755592107772827
0 references
0.875471830368042
0 references
0.8710835576057434
0 references
