Pages that link to "Item:Q501028"
From MaRDI portal
The following pages link to Adjacent vertex distinguishing colorings by sum of sparse graphs (Q501028):
Displaying 9 items.
- Neighbor sum distinguishing edge coloring of subcubic graphs (Q523715) (← links)
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree (Q1696532) (← links)
- Upper bounds for adjacent vertex-distinguishing edge coloring (Q1702826) (← links)
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz (Q1709430) (← links)
- A note on asymptotically optimal neighbour sum distinguishing colourings (Q1715623) (← links)
- Neighbor sum distinguishing index of sparse graphs (Q2194737) (← links)
- The neighbour sum distinguishing relaxed edge colouring (Q2668336) (← links)
- Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 (Q6162044) (← links)
- An improved upper bound for neighbor sum distinguishing edge colorings of graphs (Q6585249) (← links)
