Pages that link to "Item:Q497381"

The following pages link to An improved upper bound on edge weight choosability of graphs (Q497381):

Displaying 9 items.

• Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability (Q831336) (← links)
• An upper bound on adaptable choosability of graphs (Q1003583) (← links)
• Graphs are \((1, \varDelta + 1)\)-choosable (Q1618249) (← links)
• Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable (Q1660241) (← links)
• The best choice problem for upward directed graphs (Q1926501) (← links)
• Total weight choosability of graphs: towards the 1-2-3-conjecture (Q2033917) (← links)
• Neighbour-distinguishing labellings of powers of paths and powers of cycles (Q2175048) (← links)
• Weight choosability of graphs with maximum degree 4 (Q2194741) (← links)
• Bounding the monomial index and \((1,l)\)-weight choosability of a graph (Q2928589) (← links)