2-distance choice number of planar graphs with maximal degree no more than 4 (Q5025121)
From MaRDI portal
scientific article; zbMATH DE number 7467901
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 2-distance choice number of planar graphs with maximal degree no more than 4 |
scientific article; zbMATH DE number 7467901 |
Statements
2-distance choice number of planar graphs with maximal degree no more than 4 (English)
0 references
1 February 2022
0 references
planar graph
0 references
2-distance \(k\)-choosable graph
0 references
girth
0 references
maximum degree
0 references
0 references
