Pages that link to "Item:Q965260"
From MaRDI portal
The following pages link to Vertex-coloring edge-weightings: towards the 1-2-3-conjecture (Q965260):
Displaying 41 items.
- Vertex-colouring edge-weightings (Q2466341) (← links)
- Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs (Q2629488) (← links)
- A relaxed case on 1-2-3 conjecture (Q2631083) (← 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)
- An injective version of the 1-2-3 conjecture (Q2657086) (← links)
- On the standard \((2,2)\)-conjecture (Q2662793) (← links)
- On the role of 3's for the 1-2-3 conjecture (Q2692720) (← links)
- Generalized edge-colorings of weighted graphs (Q2798333) (← links)
- Vertex-coloring edge-weighting of complete \(r\)-partite graphs (Q2870955) (← links)
- Vertex-weighted graphs and their applications (Q2878217) (← links)
- Asymptotically optimal neighbour sum distinguishing colourings of graphs (Q3460519) (← links)
- Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited (Q3466345) (← links)
- NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS (Q4903632) (← links)
- Antimagic Properties of Graphs with Large Maximum Degree (Q4916097) (← links)
- Total weight choosability for Halin graphs (Q4958040) (← links)
- On the Neighbor Sum Distinguishing Index of Planar Graphs (Q4978296) (← links)
- The 1-2-3-Conjecture for Hypergraphs (Q4978298) (← links)
- On Proper Labellings of Graphs with Minimum Label Sum (Q5041179) (← links)
- A note on 1-2-3 conjecture for Halin graphs (Q5057739) (← links)
- (Q5086032) (← links)
- (Q5164968) (← links)
- Distant sum distinguishing index of graphs with bounded minimum degree (Q5217057) (← links)
- Weight choosability of oriented hypergraphs (Q5225027) (← links)
- Total Weight Choosability of Trees (Q5346547) (← links)
- A NEW VERTEX-COLORING EDGE-WEIGHTING OF COMPLETE GRAPHS (Q5407149) (← links)
- A NOTE ON EDGE WEIGHT CHOOSABILITY OF GRAPHS (Q5411805) (← links)
- Highly Irregular (Q5506772) (← links)
- Total weight choosability of graphs (Q5894172) (← links)
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz (Q5962524) (← links)
- A generalization of Faudree–Lehel conjecture holds almost surely for random graphs (Q6052468) (← links)
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees (Q6081547) (← links)
- On the total versions of 1-2-3-conjecture for graphs and hypergraphs (Q6103468) (← links)
- On decomposing multigraphs into locally irregular submultigraphs (Q6105994) (← links)
- The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures (Q6132535) (← links)
- A notion of vertex equitability for proper labellings (Q6153474) (← links)
- On inducing degenerate sums through 2-labellings (Q6154381) (← links)
- A solution to the 1-2-3 conjecture (Q6196158) (← links)
- Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment (Q6568836) (← links)
- An improved upper bound for neighbor sum distinguishing edge colorings of graphs (Q6585249) (← links)
- Adding direction constraints to the 1-2-3 conjecture (Q6652479) (← links)
