Planar graphs without triangular 4-cycles are 3-choosable (Q2454484)
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 without triangular 4-cycles are 3-choosable |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs without triangular 4-cycles are 3-choosable |
scientific article |
Statements
Planar graphs without triangular 4-cycles are 3-choosable (English)
0 references
13 June 2014
0 references
Steinberg's conjecture
0 references
Euler's formula
0 references
