Pages that link to "Item:Q2870508"
From MaRDI portal
The following pages link to Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz (Q2870508):
Displaying 37 items.
- A note on adjacent vertex distinguishing colorings of graphs (Q266908) (← links)
- Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913) (← links)
- Neighbor sum distinguishing index of planar graphs (Q396740) (← links)
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz (Q477256) (← links)
- Adjacent vertex distinguishing colorings by sum of sparse graphs (Q501028) (← links)
- Neighbor sum distinguishing edge coloring of subcubic graphs (Q523715) (← links)
- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\) (Q681756) (← links)
- The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11 (Q832991) (← links)
- Neighbor-sum-distinguishing edge choosability of subcubic graphs (Q1680485) (← links)
- Neighbor sum distinguishing index of 2-degenerate graphs (Q1680491) (← 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 total coloring and list neighbor sum distinguishing total coloring (Q1701100) (← 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)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← 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 index of sparse graphs (Q2194737) (← links)
- Neighbor sum distinguishing edge colorings of sparse graphs (Q2355754) (← links)
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz (Q2409525) (← links)
- Distant set distinguishing total colourings of graphs (Q2629496) (← links)
- Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs (Q2631097) (← links)
- Neighbor sum distinguishing index of \(K_4\)-minor free graphs (Q2631098) (← links)
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree (Q2636830) (← links)
- The neighbour sum distinguishing relaxed edge colouring (Q2668336) (← links)
- Asymptotically optimal neighbour sum distinguishing colourings of graphs (Q3460519) (← links)
- Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited (Q3466345) (← links)
- On the Neighbor Sum Distinguishing Index of Planar Graphs (Q4978296) (← links)
- On generalized neighbor sum distinguishing index of planar graphs (Q5083874) (← links)
- Progress on the Adjacent Vertex Distinguishing Edge Coloring Conjecture (Q5138970) (← 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)