1,2 conjecture-the multiplicative version

DOI10.1016/j.ipl.2008.01.006zbMath1185.05066OpenAlexW2072075198WikidataQ123095352 ScholiaQ123095352MaRDI QIDQ963408

Joanna Skowronek-Kaziów

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.01.006

zbMATH Keywords

graph algorithmsvertex colouringtotal weighting

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

The 1,2-conjecture for powers of cycles ⋮ Neighbour-distinguishing labellings of powers of paths and powers of cycles ⋮ Algorithmic complexity of proper labeling problems ⋮ Computation of lucky number of planar graphs is NP-hard ⋮ Multiplicative vertex-colouring weightings of graphs ⋮ Neighbor product distinguishing total colorings ⋮ Graphs with multiplicative vertex-coloring 2-edge-weightings ⋮ The neighbour-sum-distinguishing edge-colouring game ⋮ A note on edge weightings inducing proper vertex colorings ⋮ An oriented version of the 1-2-3 conjecture ⋮ Lucky labelings of graphs ⋮ Neighbor product distinguishing total colorings of 2-degenerate graphs

Cites Work

• Unnamed Item
• On irregular total labellings
• Edge weights and vertex colours
• Vertex colouring edge partitions

This page was built for publication: 1,2 conjecture-the multiplicative version