Total weight choosability of graphs: towards the 1-2-3-conjecture

DOI10.1016/j.jctb.2021.01.008zbMath1468.05103OpenAlexW3127740257MaRDI QIDQ2033917

Lu Cao

Publication date: 18 June 2021

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2021.01.008

zbMATH Keywords

inner productcombinatorial nullstellensatz1-2-3 conjecturetotal weight choosablilty

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Related Items

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, A solution to the 1-2-3 conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Every graph is \((2,3)\)-choosable
• A nowhere-zero point in linear mappings
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Edge weights and vertex colours
• Weight choosability of graphs
• Combinatorial Nullstellensatz
• Total Weight Choosability of Trees
• Total weight choosability of graphs
• Total weight choosability of graphs