Vertex coloring edge weightings with integer weights at most 6

zbMATH Open1202.05120MaRDI QIDQ3065462FDOQ3065462

Authors: Maciej Kalkowski, Michal Karonski, Florian Pfender 

Publication date: 6 January 2011

Full work available at URL: http://ftp.math.uni-rostock.de/pub/romako/heft64/pfender64.html

Recommendations

• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Vertex-colouring edge-weightings
• Neighbour sum distinguishing edge-weightings with local constraints
• A note on neighbour-distinguishing regular graphs total-weighting

zbMATH Keywords

graphhypergraphscoloringedge weightinglabellingweighted degrees

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (7)

• A new type of edge-derived vertex coloring
• A note on edge weightings inducing proper vertex colorings
• Title not available (Why is that?)
• A solution to the 1-2-3 conjecture
• A note on neighbour-distinguishing regular graphs total-weighting
• Neighbour sum distinguishing edge-weightings with local constraints
• Edge weights and vertex colours: minimizing sum count

This page was built for publication: Vertex coloring edge weightings with integer weights at most 6

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3065462)