Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs

DOI10.22108/TOC.2017.20988zbMath1463.05190OpenAlexW2589059532MaRDI QIDQ5134535

Massomeh Noori, Fatemeh Sadat Mousavi

Publication date: 17 November 2020

Full work available at URL: https://doaj.org/article/02c9405c6d314660b1888dc4ca199126

zbMATH Keywords

acyclic edge coloringadjacent vertex distinguishing acyclic edge chromatic numberadjacent vertex distinguishing acyclic edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• On the adjacent vertex-distinguishing acyclic edge coloring of some graphs
• An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph
• Adjacent strong edge coloring of graphs
• Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs
• Adjacent Vertex Distinguishing Edge‐Colorings
• All-to-all wavelength-routing in all-optical compound networks

This page was built for publication: Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs