\(d\)-strong total colorings of graphs

DOI10.1016/j.disc.2014.07.008zbMath1315.05055OpenAlexW2017332012MaRDI QIDQ2346331

Arnfried Kemnitz, Massimiliano Marangio

Publication date: 1 June 2015

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

Full work available at URL: https://doi.org/10.1016/j.disc.2014.07.008

zbMATH Keywords

cyclepathcirculant graphvertex distinguishing total chromatic numbervertex distinguishing total coloringstrong total chromatic numberstrong total coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items

Distant set distinguishing total colourings of graphs

Cites Work

• Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound
• The adjacent vertex distinguishing total chromatic number
• \(D(\beta)\)-vertex-distinguishing total coloring of graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
• Concise proofs for adjacent vertex-distinguishing total colorings
• A note on the adjacent vertex distinguishing total chromatic number of graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item