Neighbor sum distinguishing list total coloring of subcubic graphs

DOI10.1007/s10878-017-0239-5zbMath1387.05094OpenAlexW2772824845MaRDI QIDQ1743484

You Lu, Chuan-Dong Xu, Zheng-Ke Miao

Publication date: 13 April 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0239-5

zbMATH Keywords

list total coloringreducible configurationneighbor sum distinguishing

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions ⋮ Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Neighbor sum distinguishing total choosability of cubic graphs ⋮ Neighbor sum distinguishing total choice number of planar graphs without 6-cycles ⋮ Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten ⋮ Neighbor sum distinguishing total colorings of corona of subcubic graphs

Cites Work

• Unnamed Item
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• Neighbor sum distinguishing total colorings of planar graphs
• Every graph is \((2,3)\)-choosable
• Neighbor sum distinguishing index of 2-degenerate graphs
• Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
• The list chromatic index of a bipartite multigraph
• On the total-neighbor-distinguishing index by sums
• Neighbor sum distinguishing total coloring of 2-degenerate graphs
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• A note on 3-choosability of plane graphs under distance restrictions
• Weight choosability of graphs
• Combinatorial Nullstellensatz
• Strong Chromatic Index of 2-Degenerate Graphs
• Radio k-chromatic number of cycles for large k
• The linear 2-arboricity of sparse graphs
• Total weight choosability of graphs

This page was built for publication: Neighbor sum distinguishing list total coloring of subcubic graphs