Author:
Barber Ben,Kühn Daniela,Lo Allan,Osthus Deryk
Funder
European Research Council
Reference39 articles.
1. H-factors in dense graphs;Alon;J. Combin. Theory Ser. B,1996
2. B. Barber, D. Kühn, A. Lo, D. Osthus, A. Taylor, Clique decompositions of multipartite graphs and completion of Latin squares, preprint.
3. Decomposing graphs of high minimum degree into 4-cycles;Bryant;J. Graph Theory,2015
4. Graph decomposition is NP-complete: a complete proof of Holyer's conjecture;Dor;SIAM J. Comput.,1997
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Perfect Matchings in Random Sparsifications of Dirac Hypergraphs;Combinatorica;2024-08-05
2. Cycle decompositions in k-uniform hypergraphs;Journal of Combinatorial Theory, Series B;2024-07
3. Transversals in Latin Squares;Surveys in Combinatorics 2024;2024-06-13
4. Counting spanning subgraphs in dense hypergraphs;Combinatorics, Probability and Computing;2024-05-30
5. Threshold for Steiner triple systems;Geometric and Functional Analysis;2023-06-19