Pages that link to "Item:Q2404402"
From MaRDI portal
The following pages link to Edge-partitions of graphs and their neighbor-distinguishing index (Q2404402):
Displaying 12 items.
- 2-distance vertex-distinguishing index of subcubic graphs (Q724740) (← 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)
- On the neighbor-distinguishing indices of planar graphs (Q2117565) (← links)
- Two-distance vertex-distinguishing index of sparse subcubic graphs (Q2186287) (← links)
- Strict neighbor-distinguishing index of subcubic graphs (Q2657091) (← links)
- Neighbor-distinguishing indices of planar graphs with maximum degree ten (Q2686132) (← links)
- Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs (Q2686134) (← links)
- Local neighbor-distinguishing index of graphs (Q2693079) (← links)
- Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles (Q5858150) (← links)
- Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 (Q6162044) (← links)
- Two-distance vertex-distinguishing index of sparse graphs (Q6611486) (← links)
