Edge choosablity and total choosability of toroidal graphs without intersecting triangles. (Q4897470)
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: Edge choosablity and total choosability of toroidal graphs without intersecting triangles. |
scientific article; zbMATH DE number 6116781
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge choosablity and total choosability of toroidal graphs without intersecting triangles. |
scientific article; zbMATH DE number 6116781 |
Statements
19 December 2012
0 references
list total coloring
0 references
list edge coloring
0 references
toroidal graph
0 references
discharging method
0 references
0.8432984948158264
0 references
0.8398301005363464
0 references
0.8394823670387268
0 references
0.8318406939506531
0 references
0.8216512799263
0 references
