On the AVDTC of Sierpiński-type graphs

DOI10.1016/j.dam.2023.11.047MaRDI QIDQ6153464

Adriana J. León, Simone Dantas, Unnamed Author

Publication date: 14 February 2024

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

zbMATH Keywords

total coloringSierpiński graphsSierpiński triangle graphsadjacent-vertex-distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• The adjacent vertex distinguishing total chromatic number
• A survey and classification of Sierpiński-type graphs
• A result on the total colouring of powers of cycles
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• The total coloring of a multigraph with maximal degree 4
• 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
• Total coloring of recursive maximal planar graphs
• Compositions, decompositions, and conformability for total coloring on power of cycle graphs
• On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice 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
• The chromatic index of complete multipartite graphs
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• Vertex-distinguishing proper edge-colorings

This page was built for publication: On the AVDTC of Sierpiński-type graphs