Accessibility navigation

An algorithm for finding l -edge-connected k-factorizations of complete graphs

Lists
Tools

Hilton, A. J. W. and Johnson, M. T. (2003) An algorithm for finding l -edge-connected k-factorizations of complete graphs. Journal of Graph Theory, 43 (2). pp. 132-136.

Full text not archived in this repository.

It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.


Item Type:Article
Divisions:Science > School of Mathematical, Physical and Computational Sciences > Department of Mathematics and Statistics
ID Code:5020
Additional Information:683CT J GRAPH THEOR
Deposit Details

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation

See also