Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
type: Item
instance of: scholarly article
title: Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
zbMATH Open document ID: 1380.05076
author: You Lu
author: Miaomiao Han
author: Rong Luo
published in: Discrete Applied Mathematics
publication date: 2018-02-22T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6842197
zbMATH Keywords: neighbor sum distinguishing total coloring
zbMATH Keywords: \(\ell\)-degenerate graph
zbMATH Keywords: coloring number
zbMATH Keywords: maximum degree
MaRDI profile type: Publication
full work available at URL: j.dam.2017.12.001
OpenAlex ID: W2780965168
cites work: Combinatorial Nullstellensatz
cites work: Weight choosability of graphs
cites work: Q5422499
cites work: Strong Chromatic Index of 2-Degenerate Graphs
cites work: Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
cites work: Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
cites work: Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
cites work: Neighbor sum distinguishing index
cites work: Neighbor sum distinguishing index of 2-degenerate graphs
cites work: Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
cites work: Edge weights and vertex colours
cites work: Neighbor sum distinguishing total colorings of planar graphs
cites work: Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
cites work: On the total-neighbor-distinguishing index by sums
cites work: A note on neighbour-distinguishing regular graphs total-weighting
cites work: Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
cites work: Q3575472
cites work: Total weight choosability of graphs
cites work: Bounding the monomial index and \((1,l)\)-weight choosability of a graph
cites work: Neighbor sum distinguishing index of planar graphs
cites work: Every graph is \((2,3)\)-choosable
DOI: 10.1016/J.DAM.2017.12.001
description: scientific article; zbMATH DE number 6842197