The following pages link to (Q3640332):
Displaying 3 items.
- On the adjacent vertex-distinguishing acyclic edge coloring of some graphs (Q453364) (← links)
- An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph (Q1036905) (← links)
- On the adjacent vertex-distinguishing acyclic edge colorings of \(k\)-th power graphs (Q2924291) (← links)