The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven (Q1698052)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6841555
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven |
scientific article; zbMATH DE number 6841555 |
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
0.9718654751777648
0 references
0.9240702986717224
0 references
0.9184955954551696
0 references
0.9124681353569032
0 references
