Multiplicative vertex-colouring weightings of graphs

DOI10.1016/J.IPL.2011.11.009zbMath1239.05085OpenAlexW2003590334MaRDI QIDQ413281

Joanna Skowronek-Kaziów

Publication date: 4 May 2012

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

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

zbMATH Keywords

graph algorithmsedge-weightingtotal weightingvertex-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (10)

Product irregularity strength of graphs with small clique cover number ⋮ On a list variant of the multiplicative 1-2-3 conjecture ⋮ A relaxed case on 1-2-3 conjecture ⋮ Algorithmic complexity of proper labeling problems ⋮ A proof of the multiplicative 1-2-3 conjecture ⋮ Gap vertex-distinguishing edge colorings of graphs ⋮ Neighbor product distinguishing total colorings ⋮ Graphs with multiplicative vertex-coloring 2-edge-weightings ⋮ Neighbor product distinguishing total colorings of 2-degenerate graphs ⋮ Further evidence towards the multiplicative 1-2-3 conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• On irregular total labellings
• 1,2 conjecture-the multiplicative version
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Lucky labelings of graphs
• Edge weights and vertex colours
• Vertex-colouring edge-weightings
• Vertex colouring edge partitions
• How to Increase Robustness of Capable-to-Promise
• Adjacent Vertex Distinguishing Edge‐Colorings

This page was built for publication: Multiplicative vertex-colouring weightings of graphs