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 this page instead for the normal view: Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs |
scientific article |
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