Neighbor sum distinguishing total coloring of graphs with bounded treewidth

DOI10.1007/s10878-018-0271-0zbMath1396.05039OpenAlexW2791401467WikidataQ130072143 ScholiaQ130072143MaRDI QIDQ724731

Miaomiao Han, Rong Luo, You Lu, Zheng-Ke Miao

Publication date: 26 July 2018

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

Full work available at URL: https://doi.org/10.1007/s10878-018-0271-0

zbMATH Keywords

treewidthneighbor sum distinguishing total chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

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

Cites Work

• Unnamed Item
• The parameterised complexity of list problems on graphs of bounded treewidth
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• Neighbor sum distinguishing total colorings of planar graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• A partial k-arboretum of graphs with bounded treewidth
• Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
• Edge weights and vertex colours
• On the total-neighbor-distinguishing index by sums
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs
• List Edge-Coloring and Total Coloring in Graphs of Low Treewidth
• Combinatorial Nullstellensatz

This page was built for publication: Neighbor sum distinguishing total coloring of graphs with bounded treewidth