An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph

DOI10.1007/s10255-007-7020-yzbMath1181.05046OpenAlexW2025895663MaRDI QIDQ1036905

Xinsheng Liu, Yang Gao, Mingqiang An

Publication date: 13 November 2009

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-007-7020-y

zbMATH Keywords

adjacent strong edge coloringadjacent vertex distinguishing acyclic edge chromatic numberadjacent vertex distinguishing acyclic edge coloringthe Lovász local lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

On the adjacent vertex-distinguishing equitable edge coloring of graphs, Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs

Cites Work

• Unnamed Item
• Strong edge colorings of graphs
• On the vertex-distinguishing proper edge-colorings of graphs
• Adjacent strong edge coloring of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• Acyclic edge colorings of graphs
• Vertex-distinguishing proper edge-colorings
• Graph colouring and the probabilistic method