Author:
Hall Martin,Magnant Colton,Wang Hua
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. Diestel, R.: Graph Theory. Graduate Texts in Mathematics, 4th edn, vol. 173. Springer, Heidelberg (2010)
2. Enomoto H., Ota K.: Partitions of a graph into paths with prescribed endvertices and lengths. J. Graph Theory 34(2), 163–169 (2000)
3. Komlós J., Sárközy G.N., Szemerédi E.: Blow-up lemma. Combinatorica 17(1), 109–123 (1997)
4. Kühn D., Osthus D., Treglown A.: An Ore-type theorem for perfect packings in graphs. SIAM J. Discrete Math. 23(3), 1335–1355 (2009)
5. Magnant C., Martin D.M.: An asymptotic version of a conjecture by Enomoto and Ota. J. Graph Theory 64(1), 37–51 (2010)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献