On the AVDTC of Sierpiński-type graphs
From MaRDI portal
Publication:6153464
Recommendations
- On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs
- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
- AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\)
- Adjacent vertex-distinguishing total colorings of graphs with constraint conditions
- On the AVDTC of 4-regular graphs
Cites work
- A result on the total colouring of powers of cycles
- A survey and classification of Sierpiński-type graphs
- Adjacent strong edge coloring of graphs
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
- Compositions, decompositions, and conformability for total coloring on power of cycle graphs
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- On adjacent-vertex-distinguishing total coloring of graphs
- On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs
- On the AVDTC of 4-regular graphs
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
- On the vertex-distinguishing proper edge-colorings of graphs
- The adjacent vertex distinguishing total chromatic number
- The chromatic index of complete multipartite graphs
- The total coloring of a multigraph with maximal degree 4
- Total coloring of recursive maximal planar graphs
- Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
- Vertex-distinguishing proper edge-colorings
This page was built for publication: On the AVDTC of Sierpiński-type graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153464)
