On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\)

DOI10.1134/S000143462207015XzbMath1498.05109OpenAlexW4293373961MaRDI QIDQ2170502

Muchun Li, Xiuqing Jia, Zepeng Li, Fei Wen

Publication date: 6 September 2022

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s000143462207015x

zbMATH Keywords

total coloring\(D(2)\)-vertex-distinguishing total chromatic number\(D(2)\)-vertex-distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• \(D(\beta)\)-vertex-distinguishing total coloring of graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs
• A note on the adjacent vertex distinguishing total chromatic number of graphs
• Leaky modes and wave components of a fluid-filled borehole embedded in an elastic medium
• Neighbor sum distinguishing total colorings of corona of subcubic graphs
• Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles
• Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24
• Neighbor sum distinguishing total choosability of IC-planar graphs
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• List-coloring the square of a subcubic graph
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\)