Pages that link to "Item:Q472134"

The following pages link to The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs (Q472134):

Displaying 15 items.

• An introduction to the discharging method via graph coloring (Q507506) (← 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)
• The normal graph conjecture for two classes of sparse graphs (Q1706428) (← links)
• On a list variant of the multiplicative 1-2-3 conjecture (Q2135540) (← links)
• Going wide with the 1-2-3 conjecture (Q2166211) (← links)
• On minimizing the maximum color for the 1-2-3 conjecture (Q2217460) (← links)
• On the role of 3s for the 1--2--3 conjecture (Q2235774) (← links)
• Total weight choosability of graphs with bounded maximum average degree (Q2397545) (← links)
• An injective version of the 1-2-3 conjecture (Q2657086) (← links)
• On the semi-proper orientations of graphs (Q2663989) (← links)
• The 1‐2‐3‐conjecture holds for dense graphs (Q4632023) (← links)
• Pure pairs. III. Sparse graphs with no polynomial‐sized anticomplete pairs (Q5066924) (← links)
• A counterexample to the Bollobás–Riordan conjectures on sparse graph limits (Q5886111) (← links)
• On the total versions of 1-2-3-conjecture for graphs and hypergraphs (Q6103468) (← links)