The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 (Q832991)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 |
scientific article |
Statements
The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 (English)
0 references
28 March 2022
0 references
adjacent vertex distinguishing edge choosability
0 references
planar graph
0 references
maximum degree
0 references
0 references
0 references
