On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
From MaRDI portal
Publication:2460105
DOI10.1007/s10878-006-9038-0zbMath1125.05043OpenAlexW2006857463MaRDI QIDQ2460105
Publication date: 14 November 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-9038-0
subdivision graphadjacent vertex-distinguishing total chromatic numberadjacent vertex-distinguishing total coloringsubdivision vertex
Related Items (45)
Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ 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 colorings of 2-degenerate graphs ⋮ Adjacent vertex distinguishing total coloring of graphs with maximum degree 4 ⋮ Distant set distinguishing total colourings of graphs ⋮ Adjacent vertex distinguishing total coloring in split graphs ⋮ On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\) ⋮ The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) ⋮ Upper bounds on adjacent vertex distinguishing total chromatic number of graphs ⋮ Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree ⋮ Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable ⋮ Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ On the AVDTC of Sierpiński-type graphs ⋮ The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven ⋮ The adjacent vertex distinguishing total chromatic number ⋮ Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs ⋮ Unnamed Item ⋮ The adjacent vertex distinguishing total coloring of planar graphs ⋮ Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree ⋮ On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) ⋮ 2-distance vertex-distinguishing total coloring of graphs ⋮ Neighbor sum distinguishing total colorings of planar graphs ⋮ Vertex coloring of graphs by total 2-weightings ⋮ The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles ⋮ Graphs with multiplicative vertex-coloring 2-edge-weightings ⋮ AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\) ⋮ On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs ⋮ A note on decycling number, vertex partition and AVD-total coloring in graphs ⋮ A note on the adjacent vertex distinguishing total chromatic number of graphs ⋮ Adjacent vertex distinguishing total colorings of outerplanar graphs ⋮ On the AVDTC of 4-regular graphs ⋮ 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 sum distinguishing total colorings of \(K_4\)-minor free graphs ⋮ Neighbor product distinguishing total colorings of 2-degenerate graphs ⋮ Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve ⋮ Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten ⋮ Neighbor sum distinguishing total colorings of corona of subcubic graphs ⋮ Concise proofs for adjacent vertex-distinguishing total colorings ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 ⋮ General vertex-distinguishing total coloring of graphs ⋮ Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs ⋮ AVD-total-colouring of complete equipartite graphs
Cites Work
This page was built for publication: On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
