An improved upper bound on edge weight choosability of graphs

DOI10.1007/S00373-014-1479-0zbMath1326.05051OpenAlexW2065669620MaRDI QIDQ497381

Guang-Hui Wang, Gui Ying Yan

Publication date: 24 September 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1479-0

zbMATH Keywords

1-2-3 conjectureedge weight choosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Signed and weighted graphs (05C22)

Related Items (4)

Graphs are \((1, \varDelta + 1)\)-choosable ⋮ Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability ⋮ Neighbour-distinguishing labellings of powers of paths and powers of cycles ⋮ Weight choosability of graphs with maximum degree 4

Cites Work

• Unnamed Item
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Edge weights and vertex colours
• On total weight choosability of graphs
• Weight choosability of graphs
• A NOTE ON EDGE WEIGHT CHOOSABILITY OF GRAPHS

This page was built for publication: An improved upper bound on edge weight choosability of graphs