Every plane graph with girth at least 4 without 8- and 9-circuits is 3-choosable (Q3428684)
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 5138390
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every plane graph with girth at least 4 without 8- and 9-circuits is 3-choosable |
scientific article; zbMATH DE number 5138390 |
Statements
29 March 2007
0 references
list colouring
0 references
planar graphs
0 references
triangle-free graphs
0 references
0.9591251611709596
0 references
0.9494177103042604
0 references
0.9316381216049194
0 references
0.9167795777320862
0 references
0.8862246870994568
0 references
