Neighbor sum distinguishing list total coloring of subcubic graphs
type: Item
instance of: scholarly article
title: Neighbor sum distinguishing list total coloring of subcubic graphs
zbMATH Open document ID: 1387.05094
author: You Lu
author: Chuandong Xu
author: Zhengke Miao
published in: Journal of Combinatorial Optimization
publication date: 2018-04-13T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6859588
zbMATH Keywords: list total coloring
zbMATH Keywords: neighbor sum distinguishing
zbMATH Keywords: reducible configuration
MaRDI profile type: Publication
full work available at URL: s10878-017-0239-5
OpenAlex ID: W2772824845
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: The list chromatic index of a bipartite multigraph
cites work: Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
cites work: Neighbor sum distinguishing index of 2-degenerate graphs
cites work: A note on 3-choosability of plane graphs under distance restrictions
cites work: Radio k-chromatic number of cycles for large k
cites work: The linear 2-arboricity of sparse graphs
cites work: Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
cites work: Neighbor sum distinguishing total colorings of planar graphs
cites work: On the total-neighbor-distinguishing index by sums
cites work: Every graph is \((2,3)\)-choosable
cites work: Total weight choosability of graphs
cites work: Neighbor sum distinguishing total coloring of 2-degenerate graphs
DOI: 10.1007/S10878-017-0239-5
description: scientific article; zbMATH DE number 6859588