An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs
From MaRDI portal
Publication:1709550
DOI10.1016/J.DISC.2017.10.011zbMath1383.05124OpenAlexW2768755647MaRDI QIDQ1709550
Publication date: 5 April 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2017.10.011
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (3)
Strict neighbor-distinguishing total index of graphs ⋮ On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\) ⋮ Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve
Cites Work
- A note on the adjacent vertex distinguishing total chromatic number of graphs
- Some bounds on the neighbor-distinguishing index of graphs
- Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
- Edge-partitions of graphs and their neighbor-distinguishing index
- On adjacent-vertex-distinguishing total coloring of graphs
This page was built for publication: An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs
