Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-21T14:10:32.791Z Has data issue: false hasContentIssue false

COMPLETING AN EDGE-COLOURING OF $K_{2m}$ WITH $K_r$ AND INDEPENDENT EDGES PRECOLOURED

Published online by Cambridge University Press:  03 December 2004

M. J. HENDERSON
Affiliation:
Department of Mathematics, University of Reading, Whiteknights, PO Box 220, Reading RG6 6AX, United [email protected], [email protected]
A. J. W. HILTON
Affiliation:
Department of Mathematics, University of Reading, Whiteknights, PO Box 220, Reading RG6 6AX, United [email protected], [email protected]
Get access

Abstract

Those $(2m-1)$-edge-colourings of a spanning subgraph of $K_{2m}$, consisting of $K_{r}$ and independent edges, that can be embedded in a $(2m-1)$-edge-colouring of $K_{2m}$ are characterised.

Type
Notes and Papers
Copyright
The London Mathematical Society 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)