Orientations and detachments of graphs with prescribed degrees and connectivity
暂无分享,去创建一个
[1] Andrew U. Frank,et al. How to orient the edges of a graph? in Combinatorics , 1976 .
[2] C. Nash-Williams,et al. Connected detachments of graphs and generalized Euler trails , 1985 .
[3] Hiroshi Nagamochi. A Detachment Algorithm for Inferring a Graph from Path Frequency , 2006, COCOON.
[4] Harold N. Gabow. A matroid approach to finding edge connectivity and packing arborescences , 1991, STOC '91.
[5] C. Nash-Williams. Edge-disjoint spanning trees of finite graphs , 1961 .
[6] Konstantin Salikhov. On the orientation of graphs , 2000, math/0012252.
[7] William J. Cook,et al. Combinatorial optimization , 1997 .
[8] D. R. Fulkerson,et al. On edge-disjoint branchings , 1976, Networks.
[9] W. T. Tutte. On the Problem of Decomposing a Graph into n Connected Factors , 1961 .
[10] Bill Jackson,et al. Highly edge-connected detachments of graphs and digraphs , 2003 .
[11] Yanting Liang,et al. Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees , 2012, Appl. Math. Lett..
[12] A. Schrijver. A Course in Combinatorial Optimization , 1990 .