Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability

DOI10.37236/6878zbMath1464.05156OpenAlexW3161684814MaRDI QIDQ831336

Kasper Szabo Lyngsie, Liang Zhong

Publication date: 11 May 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/6878

zbMATH Keywords

total weighting\((k,m)\)-choosable graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• An improved upper bound on edge weight choosability of graphs
• Every graph is \((2,3)\)-choosable
• Graphs are \((1, \varDelta + 1)\)-choosable
• Edge weights and vertex colours
• On total weight choosability of graphs
• Bounding the weight choosability number of a graph
• Weight choosability of graphs
• A NOTE ON EDGE WEIGHT CHOOSABILITY OF GRAPHS