On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs

DOI10.1016/j.entcs.2019.08.005OpenAlexW2977758700WikidataQ113317428 ScholiaQ113317428MaRDI QIDQ2132331

Simone Dantas, R. Marinho, José D. Alvarado

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.005

zbMATH Keywords

hypercubespowers of cycleslattice graphsadjacent-vertex-distinguishing total chromatic numberadjacent-vertex-distinguishing total colouring

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items (1)

On the AVDTC of Sierpiński-type graphs

Cites Work

• The adjacent vertex distinguishing total chromatic number
• A result on the total colouring of powers of cycles
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• On the vertex-distinguishing proper edge-colorings of graphs
• Adjacent strong edge coloring of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• On the AVDTC of 4-regular graphs
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• On adjacent-vertex-distinguishing total coloring of graphs
• Vertex-distinguishing proper edge-colorings

This page was built for publication: On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs