On the adjacent vertex-distinguishing total chromatic numbers of the graphs with (G) = 3

DOI10.1007/S10878-006-9038-0zbMATH Open1125.05043OpenAlexW2006857463MaRDI QIDQ2460105FDOQ2460105

Authors: Haiying Wang 

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

Recommendations

• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Concise proofs for adjacent vertex-distinguishing total colorings
• A note on the adjacent vertex distinguishing total chromatic number of graphs
• Adjacent vertex distinguishing total colorings of graphs with smaller degrees
• Upper bounds on adjacent vertex distinguishing total chromatic number of graphs

zbMATH Keywords

subdivision graphadjacent vertex-distinguishing total chromatic numberadjacent vertex-distinguishing total coloringsubdivision vertex

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Adjacent strong edge coloring of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• Vertex-distinguishing proper edge-colorings
• Vertex-distinguishing edge colorings of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (51)

• On the AVDTC of Sierpiński-type graphs
• Title not available (Why is that?)
• 2-distance vertex-distinguishing total coloring of graphs
• Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs
• The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
• Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
• Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
• Adjacent vertex distinguishing total coloring in split graphs
• General vertex-distinguishing total coloring of graphs
• Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• On the AVDTC of 4-regular graphs
• Neighbor sum distinguishing total colorings of planar graphs
• Strict neighbor-distinguishing total index of graphs
• On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs
• On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs
• A note on decycling number, vertex partition and AVD-total coloring in graphs
• Adjacent vertex distinguishing total colorings of 2-degenerate graphs
• Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs
• AVD-total-colouring of complete equipartite graphs
• Upper bounds on adjacent vertex distinguishing total chromatic number of graphs
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Adjacent vertex distinguishing total colorings of outerplanar graphs
• Concise proofs for adjacent vertex-distinguishing total colorings
• A note on the adjacent vertex distinguishing total chromatic number of graphs
• On the total and AVD-total coloring of graphs
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
• Inclusion total chromatic number
• Adjacent-vertex-distinguishing total coloring of indifference graphs
• The smarandachely adjacent vertex total coloring of a kind of 3-regular graphs.
• Neighbor product distinguishing total colorings of planar graphs with maximum degree at least ten
• Neighbor sum distinguishing total colorings of corona of subcubic graphs
• The adjacent vertex distinguishing total chromatic number
• Vertex coloring of graphs by total 2-weightings
• Graphs with multiplicative vertex-coloring 2-edge-weightings
• Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve
• Title not available (Why is that?)
• The adjacent vertex distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
• Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
• Neighbor product distinguishing total colorings of 2-degenerate graphs
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
• Title not available (Why is that?)
• Upper bounds for adjacent vertex-distinguishing edge coloring
• AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\)
• Neighbor Sum Distinguishing Total Chromatic Number of Graphs with Lower Average Degree
• The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
• A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\)
• Adjacent-vertex-distinguishing total chromatic numbers on Mycielski's graphs on several kinds of particular graphs
• Distant set distinguishing total colourings of graphs
• On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\)

This page was built for publication: On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460105)