Author:
Berger Annabell,Müller-Hannemann Matthias
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Nichterlein, A.: Realizing degree sequences for directed acyclic graphs is hard. CoRR abs/1110.1510v1 (2011)
2. Lecture Notes in Computer Science;A. Berger,2011
3. Kleitman, D.J., Wang, D.L.: Algorithms for constructing graphs and digraphs with given valences and factors. Discrete Mathematics 6, 79–88 (1973)
4. Tutte, W.: The factors of graphs. Canadian J. of Mathematics 4, 314–328 (1952)
5. Berger, A.: Directed degree sequences. PhD thesis, Department of Computer Science, Martin-Luther-Universität Halle-Wittenberg, urn:nbn:de:gbv:3:4-6768 (2011)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献