Pages that link to "Item:Q2828922"
From MaRDI portal
The following pages link to On the adjacent vertex distinguishing edge chromatic number of graphs. (Q2828922):
Displaying 11 items.
- On the adjacent vertex-distinguishing equitable edge coloring of graphs (Q385210) (← links)
- On the adjacent vertex-distinguishing acyclic edge coloring of some graphs (Q453364) (← links)
- Multi-set neighbor distinguishing 3-edge coloring (Q1690251) (← links)
- On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs (Q2098173) (← links)
- Adjacent vertex distinguishing total coloring in split graphs (Q2166305) (← links)
- AVD-edge coloring on powers of paths (Q2413184) (← links)
- On generalisations of the AVD conjecture to digraphs (Q2657104) (← links)
- The algorithm for adjacent vertex distinguishing proper edge coloring of graphs (Q2788720) (← links)
- On the adjacent vertex-distinguishing acyclic edge colorings of \(k\)-th power graphs (Q2924291) (← links)
- (Q3461693) (← links)
- (Q5383624) (← links)