Vertex-coloring edge-weightings of graphs

DOI10.11650/twjm/1500406380zbMath1235.05048OpenAlexW1582106024MaRDI QIDQ647275

Qinglin Yu, Jiaojiao Wu, Gerard Jennhwa Chang, Chang-hong Lu

Publication date: 1 December 2011

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/twjm/1500406380

zbMATH Keywords

treebipartite graphvertex-coloringedge-weighting\(r\)-regular bipartite graph

Mathematics Subject Classification ID

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

Related Items

On Proper Labellings of Graphs with Minimum Label Sum, Neighbour-distinguishing labellings of families of graphs, A note on 1-2-3 conjecture for Halin graphs, Graphs with vertex-coloring and detectable 2-edge-weighting, An injective version of the 1-2-3 conjecture, Neighbour-distinguishing labellings of powers of paths and powers of cycles, The neighbour sum distinguishing relaxed edge colouring, On the total versions of 1-2-3-conjecture for graphs and hypergraphs, A notion of vertex equitability for proper labellings, A solution to the 1-2-3 conjecture, On the role of 3's for the 1-2-3 conjecture, On total weight choosability of graphs, Total weight choosability of Cartesian product of graphs, On minimizing the maximum color for the 1-2-3 conjecture, On the role of 3s for the 1--2--3 conjecture, Graphs with multiplicative vertex-coloring 2-edge-weightings, On a directed variation of the 1-2-3 and 1-2 conjectures, Unnamed Item, Equitable neighbour-sum-distinguishing edge and total colourings, Total weight choosability for Halin graphs, On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\), Edge weights and vertex colours: minimizing sum count, Unnamed Item, On proper labellings of graphs with minimum label sum