Mahdad Khatirinejad ; Reza Naserasr ; Mike Newman ; Ben Seamone ; Brett Stevens - Vertex-colouring edge-weightings with two edge weights

dmtcs:570 - Discrete Mathematics & Theoretical Computer Science, January 17, 2012, Vol. 14 no. 1 -
Vertex-colouring edge-weightings with two edge weightsArticle

Authors: Mahdad Khatirinejad 1; Reza Naserasr ORCID2; Mike Newman 3; Ben Seamone ORCID2; Brett Stevens 2

  • 1 Department of Communications and Networking [Aalto Univ]
  • 2 School of Mathematics and Statistics [Ottawa]
  • 3 Department of Mathematics and Statistics [Ottawa]

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.

Volume: Vol. 14 no. 1
Section: Graph and Algorithms
Published on: January 17, 2012
Accepted on: June 9, 2015
Submitted on: July 24, 2010
Keywords: edge weighting,graph colouring,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
    Source : OpenAIRE Graph
  • Funder: Natural Sciences and Engineering Research Council of Canada

Consultation statistics

This page has been seen 604 times.
This article's PDF has been downloaded 1111 times.