The edge-chromatic class of regular graphs of degree 4 and their complements
type: Item
instance of: scholarly article
title: The edge-chromatic class of regular graphs of degree 4 and their complements
zbMATH Open document ID: 0612.05029
DOI: 10.1016/0166-218X(87)90069-2
published in: Discrete Applied Mathematics
publication date: 1987-01-01T00:00:00Z
review text: When scheduling round robin tournaments, how many rounds may be selected at random so as to be able still to complete the total schedule? In this paper it is shown that 4 rounds may always be drawn, except for one special case with 6 players. The problem is treated as the existence of a 1-factorization for the complement of a regular graph of even order, in other words that there exists an edge-colouring with no more colours than the degree of the (regular) graph, i.e. the graph is of class 1. As part of the proof a list is obtained of all 8 regular graphs of order at most 10 which are not of class 1.
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 3989373
zbMATH Keywords: 1-factorization
zbMATH Keywords: edge-colouring
zbMATH Keywords: regular graphs
author: Amanda G. Chetwynd
author: A. J. W. Hilton
reviewed by: Frank Plastria
MaRDI profile type: Publication
Wikidata QID: Q59233690
cites work: Q3941433
cites work: Regular Graphs of High Degree are 1-Factorizable
cites work: On Hamilton's ideals
cites work: Some Theorems on Abstract Graphs
cites work: Q3853641
cites work: Premature sets of 1-factors or how not to schedule round robin tournaments
DBLP publication ID: journals/dam/ChetwyndH87
description: scientific article; zbMATH DE number 3989373