Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable (Q2671068): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
| Property / author | |||
| Property / author: Yue-ying Zhao / rank | |||
| Property / author | |||
| Property / author: Lian-Ying Miao / rank | |||
Revision as of 08:58, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable |
scientific article |
Statements
Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable (English)
0 references
3 June 2022
0 references
planar graph
0 references
DP-coloring
0 references
3-choosable
0 references
