A sufficient condition for a graph to be class 1 (Q3404683)
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 5670778
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sufficient condition for a graph to be class 1 |
scientific article; zbMATH DE number 5670778 |
Statements
12 February 2010
0 references
graph
0 references
cycle
0 references
edge coloring
0 references
Euler characteristic
0 references
0.8841472864151001
0 references
0.8782758712768555
0 references
0.8763188719749451
0 references
0.8755205869674683
0 references
0.8555828928947449
0 references
