On \((3, r)\)-choosability of some planar graphs (Q2117577)
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: On (3, r)-choosability of some planar graphs |
scientific article; zbMATH DE number 7493945
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \((3, r)\)-choosability of some planar graphs |
scientific article; zbMATH DE number 7493945 |
Statements
On \((3, r)\)-choosability of some planar graphs (English)
0 references
21 March 2022
0 references
choosability with union separation
0 references
planar graph
0 references
chorded cycle
0 references
triangle
0 references
0 references
0.906783640384674
0 references
0.886281430721283
0 references
0.8855176568031311
0 references
0.8762222528457642
0 references
0.8690720796585083
0 references
