Asymptotically optimal neighbor sum distinguishing total colorings of graphs

DOI10.1016/j.disc.2016.08.012zbMath1351.05083arXiv1507.07573OpenAlexW2963985708MaRDI QIDQ2374159

Jakub Przybyło, Sarah Loeb, Yunfang Tang

Publication date: 14 December 2016

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

Full work available at URL: https://arxiv.org/abs/1507.07573

zbMATH Keywords

neighbor-sum distinguishing indexneighbor-sum distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles ⋮ Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs ⋮ Neighbor sum distinguishing total coloring of IC-planar graphs ⋮ Neighbor sum distinguishing total coloring of sparse IC-planar graphs ⋮ Distant total sum distinguishing index of graphs ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 ⋮ Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 ⋮ Neighbor sum distinguishing total coloring of triangle free IC-planar graphs ⋮ Neighbor sum distinguishing total choosability of IC-planar graphs ⋮ Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 ⋮ On the total neighbour sum distinguishing index of graphs with bounded maximum average degree

Cites Work

• Unnamed Item
• Unnamed Item
• Neighbor sum distinguishing index
• A bound on the total chromatic number
• On the total-neighbor-distinguishing index by sums
• Neighbor sum distinguishing total colorings of triangle free planar graphs
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• How to Define an Irregular Graph
• Asymptotically optimal neighbour sum distinguishing colourings of graphs
• Near-optimal list colorings
• Graph colouring and the probabilistic method

This page was built for publication: Asymptotically optimal neighbor sum distinguishing total colorings of graphs