A non-3-choosable planar graph without cycles of length 4 and 5 (Q868377)
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 5130463
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A non-3-choosable planar graph without cycles of length 4 and 5 |
scientific article; zbMATH DE number 5130463 |
Statements
A non-3-choosable planar graph without cycles of length 4 and 5 (English)
0 references
2 March 2007
0 references
choosability
0 references
forbidden cycles
0 references
0 references
0.9107751250267028
0 references
0.8439579606056213
0 references
0.8430595993995667
0 references
0.8423675894737244
0 references
