On \(( 2 , r )\)-choosability of planar graphs without short cycles (Q2698091)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7677177
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \(( 2 , r )\)-choosability of planar graphs without short cycles |
scientific article; zbMATH DE number 7677177 |
Statements
On \(( 2 , r )\)-choosability of planar graphs without short cycles (English)
0 references
21 April 2023
0 references
choosability
0 references
planar graphs
0 references
\(C_k\)-free
0 references
discharging
0 references
0.8683869242668152
0 references
0.8651003837585449
0 references
0.8602645397186279
0 references
0.8596432209014893
0 references
0.8562874794006348
0 references
