On total weight choosability of graphs

DOI10.1007/s10878-012-9491-xzbMath1294.90053OpenAlexW2089222743MaRDI QIDQ1956254

Haili Pan, Daqing Yang

Publication date: 13 June 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9491-x

zbMATH Keywords

vertex coloringtotal weightingedge weighting

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability ⋮ Total weight choosability of cone graphs ⋮ On a list variant of the multiplicative 1-2-3 conjecture ⋮ Total weight choosability of graphs with bounded maximum average degree ⋮ An improved upper bound on edge weight choosability of graphs ⋮ Total weight choosability for Halin graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex-coloring 2-edge-weighting of graphs
• Vertex-coloring edge-weightings of graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• A note on neighbour-distinguishing regular graphs total-weighting
• Edge weights and vertex colours
• Vertex-colouring edge-weightings
• Weight choosability of graphs
• Combinatorial Nullstellensatz
• Total weight choosability of graphs
• Total weight choosability of graphs

This page was built for publication: On total weight choosability of graphs