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 the normal view instead:
scientific article; zbMATH DE number 6304266
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs without triangular 4-cycles are 3-choosable |
scientific article; zbMATH DE number 6304266 |
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
0.9400360584259032
0 references
0.90501469373703
0 references
0.8996238708496094
0 references
0.8990451097488403
0 references
0.8898732662200928
0 references
