2-distance choice number of planar graphs with maximal degree no more than 4 (Q5025121): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s1793830921500518 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3095527475 / rank | |||
Normal rank | |||
Latest revision as of 09:28, 30 July 2024
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
