Edge-choosability of planar graphs without adjacent triangles or without 7-cycles (Q998494)
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 5499874
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge-choosability of planar graphs without adjacent triangles or without 7-cycles |
scientific article; zbMATH DE number 5499874 |
Statements
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles (English)
0 references
28 January 2009
0 references
planar graph
0 references
edge-coloring
0 references
choosability
0 references
triangle
0 references
cycle
0 references
0.9379402995109558
0 references
0.9330307245254515
0 references
0.932015597820282
0 references
0.9263611435890198
0 references
0.912869393825531
0 references
