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