On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles (Q741735)
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, 1)^-choosability of planar graphs without adjacent short cycles |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles |
scientific article |
Statements
On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles (English)
0 references
12 September 2014
0 references
planar graphs
0 references
improper choosability
0 references
cycle
0 references
0 references
0.9495221376419068
0 references
0.9094891548156738
0 references
0.9072986841201782
0 references
0.8921114802360535
0 references
