Vertex-colouring edge-weightings with two edge weights - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2012

Vertex-colouring edge-weightings with two edge weights

Abstract

An edge-weighting vertex colouring of a graph is an edge-weight assignment such that the accumulated weights at the vertices yields a proper vertex colouring. If such an assignment from a set S exists, we say the graph is S-weight colourable. It is conjectured that every graph with no isolated edge is \1, 2, 3\-weight colourable. We explore the problem of classifying those graphs which are \1, 2\ -weight colourable. We establish that a number of classes of graphs are S -weight colourable for much more general sets S of size 2. In particular, we show that any graph having only cycles of length 0 mod 4 is S -weight colourable for most sets S of size 2. As a consequence, we classify the minimal graphs which are not \1, 2\-weight colourable with respect to subgraph containment. We also demonstrate techniques for constructing graphs which are not \1, 2\-weight colourable.
Fichier principal
Vignette du fichier
1690-6729-1-PB.pdf (387.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens. Vertex-colouring edge-weightings with two edge weights. Discrete Mathematics and Theoretical Computer Science, 2012, Vol. 14 no. 1 (1), pp.1-20. ⟨10.46298/dmtcs.570⟩. ⟨hal-00990567⟩

Collections

TDS-MACS
1800 View
1555 Download

Altmetric

Share

Gmail Facebook X LinkedIn More