Pages that link to "Item:Q2033917"
From MaRDI portal
The following pages link to Total weight choosability of graphs: towards the 1-2-3-conjecture (Q2033917):
Displaying 23 items.
- Total weight choosability of cone graphs (Q293660) (← links)
- The 1,2-conjecture for powers of cycles (Q324730) (← links)
- Total weight choosability of Cartesian product of graphs (Q449198) (← links)
- An improved upper bound on edge weight choosability of graphs (Q497381) (← links)
- Total weight choosability of Mycielski graphs (Q512875) (← links)
- On a directed variation of the 1-2-3 and 1-2 conjectures (Q516801) (← links)
- On weight choosabilities of graphs with bounded maximum average degree (Q516900) (← links)
- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable (Q1660241) (← links)
- A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs (Q1730218) (← links)
- The realizable extension problem and the weighted graph \((K _{3,3}, l)\) (Q1928599) (← links)
- On total weight choosability of graphs (Q1956254) (← links)
- On a list variant of the multiplicative 1-2-3 conjecture (Q2135540) (← links)
- Dense Eulerian graphs are \((1, 3)\)-choosable (Q2152793) (← links)
- Every nice graph is (1,5)-choosable (Q2171030) (← links)
- Weight choosability of graphs with maximum degree 4 (Q2194741) (← links)
- The 1-2-3 conjecture almost holds for regular graphs (Q2222048) (← links)
- An oriented version of the 1-2-3 conjecture (Q2259576) (← links)
- Weight choosability of graphs (Q3608322) (← links)
- A note on 1-2-3 conjecture for Halin graphs (Q5057739) (← links)
- Total weight choosability of graphs (Q5894172) (← 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)
- Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment (Q6568836) (← links)
