Adjacent vertex-distinguishing proper edge-coloring of strong product of graphs
From MaRDI portal
Publication:5210481
Recommendations
- Adjacent vertex distinguishing edge colorings of the direct product of a regular graph by a path or a cycle
- scientific article; zbMATH DE number 6769480
- AVD proper edge-coloring of some families of graphs
- Adjacent vertex-distinguishing colorings of the semistrong product of graphs
- On the adjacent vertex distinguishing edge chromatic number of graphs.
Cites work
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- A note on adjacent vertex distinguishing colorings of graphs
- A textbook of graph theory
- AVD-edge coloring on powers of paths
- Adjacent Vertex Distinguishing Edge‐Colorings
- Adjacent strong edge coloring of graphs
- Adjacent vertex distinguishing edge-colorings of meshes
- On the adjacent vertex-distinguishing acyclic edge coloring of some graphs
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
Cited in
(9)- Adjacent vertex-distinguishing colorings of the semistrong product of graphs
- The algorithm for adjacent vertex distinguishing proper edge coloring of graphs
- Exact vertex forwarding index of the strong product of complete graph and cycle
- Relation between Cartesian product and adjacent vertex distinguishing coloring
- scientific article; zbMATH DE number 7225175 (Why is no real title available?)
- AVD proper edge-coloring of some families of graphs
- scientific article; zbMATH DE number 6129768 (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
- Adjacent vertex distinguishing edge-colorings of meshes
This page was built for publication: Adjacent vertex-distinguishing proper edge-coloring of strong product of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5210481)
