A note on the adjacent vertex distinguishing total chromatic number of graphs

DOI10.1016/j.disc.2012.08.006zbMath1258.05037OpenAlexW2005336976MaRDI QIDQ1759396

Danjun Huang, Chengchao Yan, Wei Fan Wang

Publication date: 20 November 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2012.08.006

zbMATH Keywords

coloringtotal chromatic numbertotal coloringadjacent vertex distinguishing total coloringadjacent vertex distinguishing total chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Strict neighbor-distinguishing total index of graphs, Adjacent vertex distinguishing total colorings of 2-degenerate graphs, Neighbor sum distinguishing total choosability of planar 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, Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable, On the neighbor sum distinguishing total coloring of planar graphs, The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven, Neighbor sum distinguishing total coloring of sparse IC-planar graphs, An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs, Unnamed Item, 2-distance vertex-distinguishing total coloring of graphs, The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles, A note on decycling number, vertex partition and AVD-total coloring in graphs, A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\), Inclusion total chromatic number, Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve, General vertex-distinguishing total coloring of graphs, \(d\)-strong total colorings of graphs, Not necessarily proper total colourings which are adjacent vertex distinguishing

Cites Work

• Unnamed Item
• The adjacent vertex distinguishing total chromatic number
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Concise proofs for adjacent vertex-distinguishing total colorings
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• On adjacent-vertex-distinguishing total coloring of graphs
• Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree