A note on decycling number, vertex partition and AVD-total coloring in graphs

DOI10.1007/s00373-018-1959-8zbMath1402.05042OpenAlexW2896878751MaRDI QIDQ1756100

Chao Yang, Han Ren, Er-ling Wei

Publication date: 11 January 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-1959-8

zbMATH Keywords

vertex partitiontotal coloringdecycling numberAVD-total coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
• Concise proofs for adjacent vertex-distinguishing total colorings
• How to determine the maximum genus of a graph
• A note on the adjacent vertex distinguishing total chromatic number of graphs
• On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
• On adjacent-vertex-distinguishing total coloring of graphs
• Decycling graphs
• Reducibility among Combinatorial Problems
• Decycling Cartesian Products of Two Cycles

This page was built for publication: A note on decycling number, vertex partition and AVD-total coloring in graphs