Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs
From MaRDI portal
(Redirected from Publication:5134535)
Recommendations
- Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs
- Adjacent vertex distinguishing total coloring of Cartesian product of graphs
- An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph
- On the adjacent vertex-distinguishing acyclic edge coloring of some graphs
- scientific article; zbMATH DE number 1916560
Cites work
- 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 of meshes
- Adjacent Vertex Distinguishing Edge‐Colorings
- All-to-all wavelength-routing in all-optical compound networks
- An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph
- On the adjacent vertex-distinguishing acyclic edge coloring of some graphs
Cited in
(5)- Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs
- Vertex distinguishing edge- and total-colorings of Cartesian and other product graphs.
- scientific article; zbMATH DE number 5812811 (Why is no real title available?)
- Adjacent vertex distinguishing edge colorings of the direct product of a regular graph by a path or a cycle
- scientific article; zbMATH DE number 6001818 (Why is no real title available?)
This page was built for publication: Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5134535)
