Weight choosability of graphs with maximum degree 4

DOI10.1007/s10114-020-9371-8zbMath1441.05081OpenAlexW3034915874MaRDI QIDQ2194741

Yanyan Li

Publication date: 7 September 2020

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-020-9371-8

zbMATH Keywords

weighting1-2-3 conjecturecombinatorial Nullstellensatzweight choosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Related Items (2)

On a list variant of the multiplicative 1-2-3 conjecture ⋮ Every nice graph is (1,5)-choosable

Cites Work

• Unnamed Item
• Total weight choosability of Cartesian product of graphs
• An improved upper bound on edge weight choosability of graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
• Graphs are \((1, \varDelta + 1)\)-choosable
• Edge weights and vertex colours
• Adjacent vertex distinguishing total coloring of graphs with maximum degree 4
• Bounding the weight choosability number of a graph
• Weight choosability of graphs
• Combinatorial Nullstellensatz
• A NOTE ON EDGE WEIGHT CHOOSABILITY OF GRAPHS

This page was built for publication: Weight choosability of graphs with maximum degree 4