Advanced search

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

Download
Full text not archived in this repository.
Advice

Please see our End User Agreement.

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

Tools
Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email
Lists

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.

Additional Information 683CT J GRAPH THEOR
Item Type Article
URI https://reading-clone.eprints-hosting.org/id/eprint/5020
Divisions Science > School of Mathematical, Physical and Computational Sciences > Department of Mathematics and Statistics
Additional Information 683CT J GRAPH THEOR
Download/View statistics View download statistics for this item
Download
Full text not archived in this repository.
Tools
Add to AnyAdd to TwitterAdd to FacebookAdd to LinkedinAdd to PinterestAdd to Email
Advice

Please see our End User Agreement.

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

Lists
Deposit Details

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

Search Google Scholar