The 4-choosability of toroidal graphs without intersecting triangles (Q845970)
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: The 4-choosability of toroidal graphs without intersecting triangles |
scientific article; zbMATH DE number 5664784
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The 4-choosability of toroidal graphs without intersecting triangles |
scientific article; zbMATH DE number 5664784 |
Statements
The 4-choosability of toroidal graphs without intersecting triangles (English)
0 references
29 January 2010
0 references
toroidal graph
0 references
choosability
0 references
list coloring
0 references
cycle
0 references
combinatorial problems
0 references
0.8797551989555359
0 references
0.8628017902374268
0 references
0.8446343541145325
0 references
0.8432503938674927
0 references
0.8398301005363464
0 references
