On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) (Q1999744): 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.disc.2019.02.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2921364534 / rank | |||
Normal rank | |||
Revision as of 00:18, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) |
scientific article |
Statements
On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) (English)
0 references
27 June 2019
0 references
choosability with separation
0 references
planar graph
0 references
List coloring
0 references
cycle
0 references
