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

DOI10.37236/6878zbMATH Open1464.05156OpenAlexW3161684814MaRDI QIDQ831336FDOQ831336

Authors: Kasper Szabo Lyngsie, Liang Zhong Edit this on Wikidata

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

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

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

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)