The following pages link to Vertex-colouring edge-weightings (Q2466341):
Displayed 14 items.
- Antifactors of regular bipartite graphs (Q3386611) (← links)
- Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited (Q3466345) (← links)
- Weight choosability of graphs (Q3608322) (← links)
- NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS (Q4903632) (← links)
- Total weight choosability for Halin graphs (Q4958040) (← links)
- On the Neighbor Sum Distinguishing Index of Planar Graphs (Q4978296) (← links)
- A note on 1-2-3 conjecture for Halin graphs (Q5057739) (← links)
- Distant sum distinguishing index of graphs with bounded minimum degree (Q5217057) (← links)
- Total Weight Choosability of Trees (Q5346547) (← links)
- Total weight choosability of graphs (Q5894172) (← 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)
- On the total versions of 1-2-3-conjecture for graphs and hypergraphs (Q6103468) (← links)
- A solution to the 1-2-3 conjecture (Q6196158) (← links)