On the AVDTC of 4-regular graphs
From MaRDI portal
Publication:2017055
DOI10.1016/j.disc.2014.03.019zbMath1295.05109OpenAlexW2028137198MaRDI QIDQ2017055
Publication date: 25 June 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.03.019
Related Items (15)
Strict neighbor-distinguishing total index of 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 ⋮ Adjacent vertex distinguishing total coloring in split graphs ⋮ Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ On the AVDTC of Sierpiński-type graphs ⋮ Unnamed Item ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\) ⋮ A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) ⋮ Inclusion total chromatic number ⋮ On the total and AVD-total coloring of graphs ⋮ Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 ⋮ General vertex-distinguishing total coloring of graphs
Cites Work
- On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
- A solution to a colouring problem of P. Erdős
- Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
- On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
- On adjacent-vertex-distinguishing total coloring of graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the AVDTC of 4-regular graphs
