Adjacent vertex distinguishing colorings by sum of sparse graphs (Q501028)
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: Adjacent vertex distinguishing colorings by sum of sparse graphs |
scientific article; zbMATH DE number 6492131
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Adjacent vertex distinguishing colorings by sum of sparse graphs |
scientific article; zbMATH DE number 6492131 |
Statements
Adjacent vertex distinguishing colorings by sum of sparse graphs (English)
0 references
8 October 2015
0 references
proper edge coloring
0 references
neighbor sum distinguishing edge coloring
0 references
maximum average degree
0 references
combinatorial nullstellensatz
0 references
0 references
0 references
0 references
0.9440779
0 references
0.9420348
0 references
0.9414208
0 references
0.9401456
0 references
0.9381246
0 references
0.93644357
0 references
