The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 (Q832991)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 |
scientific article; zbMATH DE number 7499192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 |
scientific article; zbMATH DE number 7499192 |
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
0.9127535223960876
0 references
0.9102580547332764
0 references
0.90914386510849
0 references
0.8972887396812439
0 references
0.8809927701950073
0 references
