Multiplicative vertex-colouring weightings of graphs
Highlights
► We label vertices by products of weights of their adjacent edges. ► We find edge weighting by 1, 2, 3, 4 in which adjacent vertices have different labels. ► We colour vertices by products of their weight and weights of their adjacent edges. ► We find such colouring using the weights 1, 2, 4 on edges and 1, 2 on vertices.
References (11)
- et al.
Vertex colouring edge partitions
J. Combin. Theory Ser. B
(2005) - et al.
Degree constrained subgraphs
- et al.
On irregular total labellings
Discrete Math.
(2007) - et al.
Lucky labellings of graphs
Inform. Process. Lett.
(2009) - et al.
Vertex-coloring edge-weighting: toward the 1-2-3-conjecture
J. Combin. Theory Ser. B
(2010)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2011 Elsevier B.V. All rights reserved.