Planar graphs of maximum degree six without 7-cycles are class one (Q456339)
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: Planar graphs of maximum degree six without 7-cycles are class one |
scientific article; zbMATH DE number 6098359
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs of maximum degree six without 7-cycles are class one |
scientific article; zbMATH DE number 6098359 |
Statements
Planar graphs of maximum degree six without 7-cycles are class one (English)
0 references
24 October 2012
0 references
Summary: In this paper, we prove that every planar graph of maximum degree six without 7-cycles is class one.
0 references
planar graph
0 references
edge coloring
0 references
class one
0 references
cycle
0 references
