Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. Packing subgraphs in a graph;Cornuéjols;Oper. Res. Lett.,1982
2. Planar 3DM is NP-complete;Dyer;J. Algorithms,1986
3. Matchings: A well-solved class of integer linear programs;Edmonds,1970
4. Matching, Euler tours, and the Chinese postman;Edmonds;Math. Programming,1973
5. M. Loebl, private communication, 1987.
Cited by
60 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Degree sequence optimization in bounded treewidth;Optimization Letters;2023-03-22
2. Optimal General Factor Problem and Jump System Intersection;Integer Programming and Combinatorial Optimization;2023
3. Optimization over degree sequences of graphs;Discrete Applied Mathematics;2021-06
4. Graph Orientation with Edge Modifications;International Journal of Foundations of Computer Science;2021-01-30
5. On caterpillar factors in graphs;Theoretical Computer Science;2020-12