Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs (Q2631097)
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 6607392
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs |
scientific article; zbMATH DE number 6607392 |
Statements
Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs (English)
0 references
28 July 2016
0 references
neighbor sum (set)~~distinguishing total coloring
0 references
adjacent vertex distinguishing total coloring
0 references
\(d\)-degenerate graph
0 references
List total coloring
0 references
combinatorial Nullstellensatz
0 references
0 references
0 references
0 references
0.912272334098816
0 references
0.9079841375350952
0 references
0.904371440410614
0 references
0.8846021890640259
0 references
