Home > Research > Publications & Outputs > Partial-edge colouring of complete graphs or of...
View graph of relations

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

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNChapter

Published
Publication date1984
Host publicationGraph theory and combinatorics : proceedings of the Cambridge Combinatorial Conference in honour of Paul Erdős
EditorsBéla Bollobás
Place of PublicationLondon
PublisherAcademic Press
Pages81-98
Number of pages18
ISBN (print)012111760X
<mark>Original language</mark>English