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

DOI10.37236/6878MaRDI QIDQ831336zbMATH OpenOpenAlexFDO

Authors Kasper Szabo Lyngsie, Liang Zhong

Publication date 11 May 2021

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

Copyright license Creative Commons Attribution 4.0 International

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• Graphs are \((1, \varDelta + 1)\)-choosable
• Total weight choosability of graphs
• A note on edge weight choosability of graphs
• Total weight choosability of graphs with bounded maximum average degree
• An improved upper bound on edge weight choosability of graphs

Cites work

• A note on edge weight choosability of graphs
• An improved upper bound on edge weight choosability of graphs
• Bounding the monomial index and \((1,l)\)-weight choosability of a graph
• Edge weights and vertex colours
• Every graph is \((2,3)\)-choosable
• Graphs are \((1, \varDelta + 1)\)-choosable
• On a \(1,2\) conjecture
• On total weight choosability of graphs
• Weight choosability of graphs

Cited in

(5)

• A note on edge weight choosability of graphs
• Graphs are \((1, \varDelta + 1)\)-choosable
• Total weight choosability of graphs
• An improved upper bound on edge weight choosability of graphs
• Bounding the monomial index and \((1,l)\)-weight choosability of a graph

This page was built for publication: Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831336)