Graph orientations with edge-connection and parity constraints

Combinatorica

Volumn 22, Issue 1, 2002, Pages 47-70

  Frank, András ^a,b   Király, Zoltán ^a,b  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^b ERICSSON RESEARCH   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036435028     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930200003     Document Type: Article

References (20)

1. A. Ageev, A. Kostochka, and Z. Szigeti: A characterization of Seymour graphs, Y. Graph Theory, 24 (1997), 357-364.
2. W. Cunningham and J. Geelen: The optimal path-matching problem, Combinatorica, 17 (1997), 315-338.
3. A. Frank: On the orientation of graphs, J. Combin. Theory, Ser. B, 28 (1980), 251-261.
4. A. Frank, A. Sebö, and É. Tardos: Covering directed and odd cuts, Mathematical Programming Studies, 22 (1984), 99-112.
5. A. Frank, T. Jordán, and Z. Szigeti: An orientation theorem with parity constraints, in: Integer Programming and Combinatorial Optimization (G. Cornuejols, R. Burkard, G.J. Woeginger, eds.) Springer, Lecture Notes in Computer Science 1610, 1999, 183-190. (Proceedings of the 7th International IPCO Conference held in Graz, Austria, June 1999.).
6. A. Frank: Connectivity augmentation problems in network design, in: Mathematical Programming: State of the Art 1994, (J.R. Birge and K.G. Murty, eds.) The University of Michigan, 34-63.
7. A. Frank and L. Szegö: An extension of a theorem of Henneberg and Laman, Proceedings of the 8th International IPCO Conference, June 2001, (K. Aardal and B. Gerards eds.), Springer, 145-160.
8. R. Giles: Optimum matching forests, I-II-III, Mathematical Programming, 22 (1982), 1-51.
9. L. Lovász: Subgraphs with prescribed valencies, J. Combin. Theory, 8 (1970), 391-416.
10. L. Lovász: Selecting independent lines from a family of lines in a space, Acta Sci. Univ. Szeged, 43 (1980), 121-131.
11. W. Mader: Ecken vom Innen- und Aussengrad k in minimal n-fach kantenzusammenhängenden Digraphen, Arch. Math., 25 (1974) 107-112.
12. W. Mader: Über die Maximalzahl kantendisjunkter A-Wege, Archly der Mathematik (Basel), 30 (1978), 325-336.
13. W. Mader: Konstruktion aller n-fach kantenzusammenhängenden Digraphen, Europ. J. Combinatorics, 3 (1982), 63-67.
14. M. Middendorf and F. Pfeiffer: On the complexity of the edge-disjoint path problem, Combinatorica, 13 (1993), 97-108.
15. C.S.T.J.A. Nash-Williams: On orientations, connectivity, and odd vertex pairings in finite graphs, Canad. J. Math., 12 (1960), 555-567.
16. L. Nebeský: A new characterization of the maximum genus of a graph, Czechoslovak Mathematical Journal, 31(106), (1981), 604-613.
17. P.D. Seymour: The matroids with the max-flow min-cut property, J. Combin. Theory, Ser. B, 23 (1977), 189-222.
18. P.D. Seymour: On odd cuts and plane multicommodity flows, Proceedings of the London Math. Soc., 42 (1981), 178-192.
19. W.T. Tutte: On the problem of decomposing a graph into n connected factors, J. London Math. Soc., 36 (1961), 221-230.
20. W.T. Tutte: The factorization of linear graphs, J. London Math. Soc., 22 (1947), 107-111.