The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven (Q1698052): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10878-017-0149-6 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-017-0149-6 / rank | |||
Normal rank | |||
Latest revision as of 04:30, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven |
scientific article |
Statements
The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven (English)
0 references
21 February 2018
0 references
adjacent vertex distinguishing total choosability
0 references
planar graph
0 references
maximum degree
0 references
0 references
0 references
0 references
0 references
0 references
0 references
