scientific article; zbMATH DE number 5629882

MaRDI QIDQ3640332zbMATH OpenFDO

Authors Huiying Qiang, Muchun Li, Zhongfu Zhang

Publication date 11 November 2009

zbMATH Keywords

acyclic edge coloring of graphsadjacent strong edge coloring of graphsLovász local lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the adjacent vertex-distinguishing acyclic edge coloring of some graphs
• Adjacent vertex-distinguishing acyclic edge coloring of graphs
• An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph
• Upper bounds for adjacent vertex-distinguishing edge coloring
• On the adjacent vertex distinguishing edge colourings of graphs
• A note on adjacent vertex distinguishing colorings of graphs
• On adjacent-vertex-distinguishing total coloring of graphs
• Adjacent vertex-distinguishing edge coloring of graphs
• Adjacent vertex-distinguishing total colorings of graphs with constraint conditions
• On the adjacent vertex-distinguishing acyclic edge colorings of k-th power graphs

Cited in

(5)

• An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph
• On the adjacent vertex-distinguishing acyclic edge colorings of k-th power graphs
• Adjacent vertex-distinguishing acyclic edge coloring of graphs
• On the adjacent vertex-distinguishing acyclic edge coloring of some graphs
• An upper bound of the Smarandachely-adjacent-vertex acyclic edge coloring of graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3640332)