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

DOI10.1134/S000143462207015XzbMATH Open1498.05109OpenAlexW4293373961MaRDI QIDQ2170502FDOQ2170502

Authors: Fei Wen, Xiuqing Jia, Zepeng Li, Muchun Li 

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

Recommendations

• 2-distance vertex-distinguishing total coloring of graphs
• \(D(\beta)\)-vertex-distinguishing total coloring of graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• An upper bound for \(D\)(2)-vertex-distinguishing proper edge chromatic numbers of graphs
• \(D(\beta)\)-vertex-distinguishing proper total coloring of the generalized Mycielski graph \(M_n(P^3_m)\)

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

• A note on the adjacent vertex distinguishing total chromatic number of graphs
• Graph theory with applications
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent Vertex Distinguishing Edge‐Colorings
• List-coloring the square of a subcubic graph
• 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
• Leaky modes and wave components of a fluid-filled borehole embedded in an elastic medium
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
• \(D(\beta)\)-vertex-distinguishing total coloring of graphs
• An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs
• Neighbor sum distinguishing total colorings of corona of subcubic graphs

Cited In (10)

• 2-distance vertex-distinguishing total coloring of graphs
• Distinguishing graphs by total colourings
• \(D(\beta)\)-vertex-distinguishing total coloring of graphs
• \(D(r)\)-vertex distinguishing edge coloring of trees
• \(d\)-strong total colorings of cycles when \(35\leq d\leq 55\)
• On \(N_2\)-vertex coloring of graphs
• Title not available (Why is that?)
• \(D(\beta)\)-vertex-distinguishing proper total coloring of the generalized Mycielski graph \(M_n(P^3_m)\)
• On \(d_2\)-coloring of certain families of graphs
• Distant set distinguishing total colourings of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170502)