Planar graphs without triangular 4-cycles are 3-choosable (Q2454484): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:50, 2 February 2024
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
