Partial-edge colouring of complete graphs or of graphs which are nearly complete.

Chetwynd, Amanda G. and Hilton, A. J. W. (1984) Partial-edge colouring of complete graphs or of graphs which are nearly complete. In: Graph theory and combinatorics : proceedings of the Cambridge Combinatorial Conference in honour of Paul Erdős. Academic Press, London, pp. 81-98. ISBN 012111760X

Full text not available from this repository.
Item Type:
Contribution in Book/Report/Proceedings
Uncontrolled Keywords:
/dk/atira/pure/researchoutput/libraryofcongress/qa
Subjects:
ID Code:
19947
Deposited By:
Deposited On:
20 Nov 2008 16:07
Refereed?:
No
Published?:
Published
Last Modified:
03 May 2020 00:22