The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven (Q1698052): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-017-0149-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2732132030 / rank | |||
Normal rank | |||
Revision as of 21:46, 19 March 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
