A sufficient condition for a plane graph with maximum degree 6 to be class 1 (Q1759890)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A sufficient condition for a plane graph with maximum degree 6 to be class 1 |
scientific article; zbMATH DE number 6109953
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sufficient condition for a plane graph with maximum degree 6 to be class 1 |
scientific article; zbMATH DE number 6109953 |
Statements
A sufficient condition for a plane graph with maximum degree 6 to be class 1 (English)
0 references
22 November 2012
0 references
planar graph conjecture
0 references
edge coloring
0 references
maximum degree
0 references
0.9302735924720764
0 references
0.9276559948921204
0 references
0.9045372009277344
0 references
0.8953615427017212
0 references
0.8929885625839233
0 references
