Graphs are \((1, \varDelta + 1)\)-choosable

DOI10.1016/j.disc.2018.10.004zbMath1400.05104OpenAlexW2898809823MaRDI QIDQ1618249

Xiaowei Yu, Guan-Huei Duh, Tsai-Lien Wong, Xuding Zhu, Jian Liang Wu, Lai-hao Ding, Guang-Hui Wang

Publication date: 13 November 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.10.004

zbMATH Keywords

permanenttotal weighting\((k, k^\prime)\)-choosable graphs

Mathematics Subject Classification ID

Connectivity (05C40) Vertex degrees (05C07) Signed and weighted graphs (05C22)

Related Items (7)

Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability ⋮ On a list variant of the multiplicative 1-2-3 conjecture ⋮ Dense Eulerian graphs are \((1, 3)\)-choosable ⋮ Every nice graph is (1,5)-choosable ⋮ Weight choosability of graphs with maximum degree 4 ⋮ 2-connected chordal graphs and line graphs are \((1,5)\)-choosable ⋮ 1-2-3 Conjecture in digraphs: more results and directions

Cites Work

• Unnamed Item
• An improved upper bound on edge weight choosability of graphs
• Every graph is \((2,3)\)-choosable
• A nowhere-zero point in linear mappings
• On irregular total labellings
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• On vertex-coloring 13-edge-weighting
• Colorings and orientations of graphs
• Edge weights and vertex colours
• Vertex-colouring edge-weightings
• Vertex colouring edge partitions
• Bounding the weight choosability number of a graph
• Weight choosability of graphs
• Combinatorial Nullstellensatz
• Total weight choosability of graphs
• Total weight choosability of graphs

This page was built for publication: Graphs are \((1, \varDelta + 1)\)-choosable