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 3 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)