Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable (Q858302)
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: Every toroidal graph without adjacent triangles is (4,1)^*-choosable |
scientific article; zbMATH DE number 5082758
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable |
scientific article; zbMATH DE number 5082758 |
Statements
Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable (English)
0 references
9 January 2007
0 references
choosability
0 references
linear algorithm
0 references
0 references
0.8907423615455627
0 references
0.8797551989555359
0 references
0.8597822785377502
0 references
0.8563755750656128
0 references
0.8505591154098511
0 references
