Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable (Q858302): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.04.042 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2045528288 / rank | |||
Normal rank | |||
Revision as of 01:06, 20 March 2024
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
