A NOTE ON EDGE WEIGHT CHOOSABILITY OF GRAPHS

DOI10.1142/S1793830914500104zbMath1286.05047MaRDI QIDQ5411805

Jingcheng Fu, Jin Xu, Guang-Hui Wang, Jian Liang Wu

Publication date: 25 April 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

1-2-3 conjectureedge weight choosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability ⋮ Weight choosability of graphs with maximum degree 4 ⋮ An improved upper bound on edge weight choosability of graphs

Cites Work

• Unnamed Item
• The sigma chromatic number of a graph
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Edge weights and vertex colours
• Weight choosability of graphs
• Combinatorial Nullstellensatz

This page was built for publication: A NOTE ON EDGE WEIGHT CHOOSABILITY OF GRAPHS