Pages that link to "Item:Q3466345"
From MaRDI portal
The following pages link to Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited (Q3466345):
Displaying 22 items.
- Neighbor sum distinguishing edge coloring of subcubic graphs (Q523715) (← links)
- Neighbor-sum-distinguishing edge choosability of subcubic graphs (Q1680485) (← links)
- List neighbor sum distinguishing edge coloring of subcubic graphs (Q1686014) (← links)
- Distant set distinguishing edge colourings of graphs (Q1686263) (← 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)
- Local antimagic orientations of \(d\)-degenerate graphs (Q1730236) (← links)
- Distant sum distinguishing index of graphs (Q2012525) (← links)
- Neighbor sum distinguishing index of subcubic graphs (Q2014224) (← links)
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs (Q2182186) (← links)
- Neighbor sum distinguishing edge colorings of sparse graphs (Q2355754) (← links)
- Local antimagic labeling of graphs (Q2423101) (← links)
- Distant set distinguishing total colourings of graphs (Q2629496) (← links)
- The neighbour sum distinguishing relaxed edge colouring (Q2668336) (← links)
- On the Neighbor Sum Distinguishing Index of Planar Graphs (Q4978296) (← links)
- On generalized neighbor sum distinguishing index of planar graphs (Q5083874) (← links)
- Distant sum distinguishing index of graphs with bounded minimum degree (Q5217057) (← links)
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz (Q5962524) (← links)
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees (Q6081547) (← links)
- Neighbour sum distinguishing edge-weightings with local constraints (Q6103480) (← links)
- An improved upper bound for neighbor sum distinguishing edge colorings of graphs (Q6585249) (← links)
