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 8 items.
- 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)
- 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)
