On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) (Q1999744): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:31, 5 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
