Edge-choosability of planar graphs without chordal 6-cycles (Q2895387)
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 6052169
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge-choosability of planar graphs without chordal 6-cycles |
scientific article; zbMATH DE number 6052169 |
Statements
2 July 2012
0 references
planar graph
0 references
edge-coloring
0 references
edge k-choosability
0 references
cycle
0 references
chord
0 references
combinatorial problem
0 references
Edge-choosability of planar graphs without chordal 6-cycles (English)
0 references
0.962790310382843
0 references
0.9534901976585388
0 references
0.936935544013977
0 references
0.9356312155723572
0 references
0.932015597820282
0 references
