Edge-choosability of planar graphs without non-induced 5-cycles (Q976112): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:43, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Edge-choosability of planar graphs without non-induced 5-cycles |
scientific article |
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
