Premium
Completing an Edge‐Colouring of K 2 m with K r and Independent Edges Precoloured
Author(s) -
Henderson M. J.,
Hilton A. J. W.
Publication year - 2004
Publication title -
journal of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.441
H-Index - 62
eISSN - 1469-7750
pISSN - 0024-6107
DOI - 10.1112/s0024610704005526
Subject(s) - enhanced data rates for gsm evolution , combinatorics , mathematics , computer science , artificial intelligence
Those (2 m −1)‐edge‐colourings of a spanning subgraph of K 2 m , consisting of K r and independent edges, that can be embedded in a (2m‐1)‐edge‐colouring of K 2 m are characterised.