A.J.W. Hilton
An algorithm for finding factorizations of complete graphs,
Hilton, A.J.W.; Johnson, Matthew
Abstract
We show how to find a decomposition of the edge set of the complete graph into regular factors where the degree and edge-connectivity of each factor is given.
Journal Article Type | Article |
---|---|
Publication Date | 2003 |
Journal | Journal of Graph Theory |
Print ISSN | 0364-9024 |
Publisher | Wiley |
Volume | 43 |
Pages | 132-136 |
DOI | https://doi.org/10.1002/jgt.10109 |
Public URL | https://durham-repository.worktribe.com/output/1556509 |
Publisher URL | http://www3.interscience.wiley.com/cgi-bin/abstract/104527335/ABSTRACT |
You might also like
Computing weighted subset transversals in H-free graphs
(2021)
Presentation / Conference Contribution
Computing subset transversals in H-free graphs
(2020)
Presentation / Conference Contribution
Steiner trees for hereditary graph classes
(2020)
Presentation / Conference Contribution
Independent transversals versus transversals
(2019)
Presentation / Conference Contribution
On cycle transversals and their connected variants in the absence of a small linear forest
(2019)
Presentation / Conference Contribution
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search