scientific article; zbMATH DE number 6273736

zbMath1283.05105MaRDI QIDQ5403011

Brett Stevens, Reza Naserasr, Ben Seamone, Mahdad Khatirinejad, Michael W. Newman

Publication date: 25 March 2014

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1690/0.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph colouringedge weighting

Mathematics Subject Classification ID

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

Related Items (9)

Neighbour-distinguishing labellings of families of graphs ⋮ The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture ⋮ Neighbour-distinguishing labellings of powers of paths and powers of cycles ⋮ Algorithmic complexity of proper labeling problems ⋮ On the total versions of 1-2-3-conjecture for graphs and hypergraphs ⋮ On a total version of 1-2-3 conjecture ⋮ Equitable neighbour-sum-distinguishing edge and total colourings ⋮ On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs ⋮ On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\)

This page was built for publication: