Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring

DOI10.1016/j.dam.2017.12.001zbMath1380.05076OpenAlexW2780965168MaRDI QIDQ1701100

Miaomiao Han, Rong Luo, You Lu

Publication date: 22 February 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.12.001

zbMATH Keywords

coloring numbermaximum degreeneighbor sum distinguishing total coloring\(\ell\)-degenerate graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions ⋮ Neighbor sum distinguishing total coloring of IC-planar graphs ⋮ Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 ⋮ Neighbor sum distinguishing list total coloring of subcubic graphs ⋮ Neighbor sum distinguishing total coloring of triangle free IC-planar graphs ⋮ Neighbor sum distinguishing total choice number of planar graphs without 6-cycles ⋮ Neighbor sum distinguishing total coloring of graphs with bounded treewidth ⋮ Neighbor sum distinguishing total choosability of IC-planar graphs ⋮ Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13

Cites Work

• Unnamed Item
• Unnamed Item
• Neighbor sum distinguishing index
• Neighbor sum distinguishing index of planar graphs
• Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
• Neighbor sum distinguishing total colorings of planar graphs
• Every graph is \((2,3)\)-choosable
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• A note on neighbour-distinguishing regular graphs total-weighting
• Neighbor sum distinguishing index of 2-degenerate graphs
• 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 distinguishing edge colorings of graphs with bounded maximum average degree
• Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
• Bounding the weight choosability number of a graph
• Weight choosability of graphs
• Combinatorial Nullstellensatz
• Strong Chromatic Index of 2-Degenerate Graphs
• Total weight choosability of graphs
• Total weight choosability of graphs

This page was built for publication: Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring