On the adjacent vertex-distinguishing acyclic edge coloring of some graphs

DOI10.1007/s11766-011-2309-2zbMath1265.05249OpenAlexW2000862126MaRDI QIDQ453364

Wai Chee Shiu, Liang Bian, Wai Hong Chan, Zhong Fu Zhang

Publication date: 5 October 2012

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-011-2309-2

zbMATH Keywords

adjacent strong edge coloringadjacent vertex-distinguishing acyclic edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

AVD proper edge-coloring of some families of graphs ⋮ Unnamed Item ⋮ Upper bounds on vertex distinguishing chromatic indices of some Halin graphs ⋮ Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong edge colorings of graphs
• On the vertex-distinguishing proper edge-colorings of graphs
• Algorithmic aspects of acyclic edge colorings
• Adjacent strong edge coloring of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Acyclic edge colorings of graphs
• Acyclic coloring of graphs
• Vertex-distinguishing proper edge-colorings
• Graph colouring and the probabilistic method