Pages that link to "Item:Q741759"
From MaRDI portal
The following pages link to An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph (Q741759):
Displaying 19 items.
- Upper bounds on vertex distinguishing chromatic indices of some Halin graphs (Q377916) (← links)
- An upper bound for the adjacent vertex distinguishing acyclic edge chromatic number of a graph (Q1036905) (← links)
- Upper bounds for adjacent vertex-distinguishing edge coloring (Q1702826) (← links)
- An improved upper bound on the adjacent vertex distinguishing total chromatic number of graphs (Q1709550) (← links)
- Neighbor sum distinguishing index of subcubic graphs (Q2014224) (← links)
- On the neighbor-distinguishing indices of planar graphs (Q2117565) (← links)
- Two-distance vertex-distinguishing index of sparse subcubic graphs (Q2186287) (← links)
- Some bounds on the neighbor-distinguishing index of graphs (Q2352066) (← links)
- Edge-partitions of graphs and their neighbor-distinguishing index (Q2404402) (← links)
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number (Q2573644) (← links)
- Strict neighbor-distinguishing index of subcubic graphs (Q2657091) (← links)
- Neighbor-distinguishing indices of planar graphs with maximum degree ten (Q2686132) (← links)
- The algorithm for adjacent vertex distinguishing proper edge coloring of graphs (Q2788720) (← links)
- (Q3572447) (← links)
- (Q5194469) (← links)
- Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number (Q5229341) (← links)
- (Q5354848) (← links)
- Two-distance vertex-distinguishing index of sparse graphs (Q6611486) (← links)
- On the inclusion chromatic index of a Halin graph (Q6646393) (← links)
