Edge-choosability of planar graphs without non-induced 5-cycles (Q976112)
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: Edge-choosability of planar graphs without non-induced 5-cycles |
scientific article; zbMATH DE number 5722000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge-choosability of planar graphs without non-induced 5-cycles |
scientific article; zbMATH DE number 5722000 |
Statements
Edge-choosability of planar graphs without non-induced 5-cycles (English)
0 references
16 June 2010
0 references
planar graph
0 references
edge-coloring
0 references
choosability
0 references
cycle
0 references
chord
0 references
combinatorial problems
0 references
0.98102176
0 references
0.9767715
0 references
0.95932084
0 references
0.9453177
0 references
0.9452999
0 references
0.9452999
0 references
0.9436352
0 references
0.94053394
0 references
0.93807375
0 references
