Sequence variations of the 1-2-3 Conjecture and irregularity strength

zbMath1283.05121arXiv1211.0463MaRDI QIDQ5747368

Brett Stevens, Ben Seamone

Publication date: 14 February 2014

Full work available at URL: https://arxiv.org/abs/1211.0463

zbMATH Keywords

vertex colouring1-2-3 conjectureedge weighting

Mathematics Subject Classification ID

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

Related Items (5)

On the algorithmic complexity of zero-sum edge-coloring ⋮ On the semi-proper orientations of graphs ⋮ Graphs with multiplicative vertex-coloring 2-edge-weightings ⋮ Algorithmic complexity of weakly semiregular partitioning and the representation number ⋮ On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs

This page was built for publication: Sequence variations of the 1-2-3 Conjecture and irregularity strength