On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\)

DOI10.7151/dmgt.2250zbMath1484.05090OpenAlexW2913710278MaRDI QIDQ2062679

Julien Bensmail, Kasper Szabo Lyngsie, Fionn Mc Inerney

Publication date: 3 January 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2250

zbMATH Keywords

bipartite graphs1-2-3 conjectureneighbour-sum-distinguishing edge-weightingsodd weights

Mathematics Subject Classification ID

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

Related Items (2)

An injective version of the 1-2-3 conjecture ⋮ On proper labellings of graphs with minimum label sum

Cites Work

• Unnamed Item
• Unnamed Item
• The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
• Algorithmic complexity of proper labeling problems
• Graph factors modulo \(k\)
• Vertex-coloring 2-edge-weighting of graphs
• Vertex-coloring edge-weightings of graphs
• Edge weights and vertex colours
• Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights
• Weight choosability of graphs
• On neighbour sum-distinguishing $\{0,1\}$-edge-weightings of bipartite graphs
• On the 1-2-3-conjecture

This page was built for publication: On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\)