On a 1, 2 Conjecture - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2010

On a 1, 2 Conjecture


Let us assign positive integers to the edges and vertices of a simple graph G. As a result we obtain a vertex-colouring of G with integers, where a vertex colour is simply a sum of the weight assigned to the vertex itself and the weights of its incident edges. Can we obtain a proper colouring using only weights 1 and 2 for an arbitrary G? We give a positive answer when G is a 3-colourable, complete or 4-regular graph. We also show that it is enough to C use weights from 1 to 11, as well as from 1 to 11 [chi(G)/2] + 1, for an arbitrary graph G.
Fichier principal
Vignette du fichier
948-4947-1-PB.pdf (162.49 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00990444 , version 1 (13-05-2014)



Jakub Przybylo, Mariusz Woźniak. On a 1, 2 Conjecture. Discrete Mathematics and Theoretical Computer Science, 2010, Vol. 12 no. 1 (1), pp.101-108. ⟨10.46298/dmtcs.491⟩. ⟨hal-00990444⟩


112 View
1301 Download



Gmail Facebook Twitter LinkedIn More