Pages that link to "Item:Q1036905"
From MaRDI portal
The following pages link to An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph (Q1036905):
Displaying 10 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)
- Upper bounds for adjacent vertex-distinguishing edge coloring (Q1702826) (← links)
- An upper bound for \(D\)(2)-vertex-distinguishing proper edge chromatic numbers of graphs (Q2858198) (← links)
- On the adjacent vertex-distinguishing acyclic edge colorings of \(k\)-th power graphs (Q2924291) (← links)
- (Q3072236) (← links)
- (Q3572447) (← links)
- (Q3640332) (← links)
- Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs (Q5134535) (← links)
- (Q5194469) (← links)