Pages that link to "Item:Q2355754"
From MaRDI portal
The following pages link to Neighbor sum distinguishing edge colorings of sparse graphs (Q2355754):
Displaying 17 items.
- Adjacent vertex distinguishing colorings by sum of sparse graphs (Q501028) (← links)
- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) (Q681756) (← links)
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree (Q726516) (← links)
- The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 (Q832991) (← links)
- Neighbor sum distinguishing index of 2-degenerate graphs (Q1680491) (← links)
- List neighbor sum distinguishing edge coloring of subcubic graphs (Q1686014) (← links)
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree (Q1696532) (← 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)
- Neighbour-distinguishing edge colourings of random regular graphs (Q2500996) (← links)
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree (Q2636830) (← links)
- The neighbour sum distinguishing relaxed edge colouring (Q2668336) (← links)
- Neighbor sum distinguishing total coloring of a kind of sparse graph. (Q2829032) (← links)
- (Q2991674) (← links)
- Asymptotically optimal neighbour sum distinguishing colourings of graphs (Q3460519) (← links)
- Neighbor sum distinguishing index of a kind of sparse graphs (Q4640905) (← links)
