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

DOI10.1007/S11766-011-2309-2MaRDI QIDQ453364zbMATH OpenOpenAlexFDO

Authors Wai Chee Shiu, Liang Bian, W. H. Chan, Zhongfu 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)

Recommendations

• An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph
• scientific article; zbMATH DE number 5629882
• Adjacent vertex-distinguishing acyclic edge coloring of graphs
• On the adjacent vertex-distinguishing acyclic edge colorings of \(k\)-th power graphs
• On the adjacent vertex distinguishing edge chromatic number of graphs.

Cites work

• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• scientific article; zbMATH DE number 53883 (Why is no real title available?)
• scientific article; zbMATH DE number 1472164 (Why is no real title available?)
• scientific article; zbMATH DE number 1874375 (Why is no real title available?)
• Acyclic coloring of graphs
• Acyclic edge colorings of graphs
• Adjacent strong edge coloring of graphs
• Algorithmic aspects of acyclic edge colorings
• Graph colouring and the probabilistic method
• On the vertex-distinguishing proper edge-colorings of graphs
• Strong edge colorings of graphs
• Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
• Vertex-distinguishing proper edge-colorings
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number

Cited in

(14)

• An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph
• Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs
• Adjacent vertex-distinguishing proper edge-coloring of strong product of graphs
• Adjacent vertex-distinguishing acyclic edge coloring of graphs
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
• Upper bounds on vertex distinguishing chromatic indices of some Halin graphs
• AVD proper edge-coloring of some families of graphs
• Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs
• On the adjacent vertex-distinguishing equitable edge coloring of graphs
• scientific article; zbMATH DE number 5629882 (Why is no real title available?)
• On the adjacent vertex-distinguishing acyclic edge colorings of \(k\)-th power graphs
• A note on adjacent vertex distinguishing colorings of graphs
• scientific article; zbMATH DE number 6453552 (Why is no real title available?)
• On the adjacent vertex distinguishing edge chromatic number of graphs.

This page was built for publication: On the adjacent vertex-distinguishing acyclic edge coloring of some graphs

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