Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable (Q858302)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable |
scientific article |
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
