-
1
-
-
0346321988
-
On Reid's characterization of the ternary matroids
-
Bixby, R. E., On Reid's characterization of the ternary matroids. J. Combin. Theory Ser. B 26 (1979), 174-204.
-
(1979)
J. Combin. Theory Ser. B
, vol.26
, pp. 174-204
-
-
Bixby, R.E.1
-
2
-
-
0001459668
-
A combinatorial decomposition theory
-
Cunningham, W. H., and Edmonds, J., A combinatorial decomposition theory. Canad. J. Math. 32 (1980), 734-765.
-
(1980)
Canad. J. Math.
, vol.32
, pp. 734-765
-
-
Cunningham, W.H.1
Edmonds, J.2
-
3
-
-
0001853238
-
Highly connected sets and the excluded grid theorem
-
Diestel, Reinhard, Gorbunov, KonstantinYu., Jensen, Tommy R., and Thomassen, Carsten, Highly connected sets and the excluded grid theorem. J. Combin. Theory Ser. B 99 (1999), 61-73.
-
(1999)
J. Combin. Theory Ser. B
, vol.99
, pp. 61-73
-
-
Diestel, R.1
Gorbunov, K.Yu.2
Jensen, T.R.3
Thomassen, C.4
-
4
-
-
84883316196
-
A property in 4-chromatic graphs and some remarks on critical graphs
-
Dirac, G. A., A property in 4-chromatic graphs and some remarks on critical graphs. J. London Math. Soc. 27 (1952), 85-92.
-
(1952)
J. London Math. Soc.
, vol.27
, pp. 85-92
-
-
Dirac, G.A.1
-
5
-
-
1842565335
-
Amin-max theorem using matroid separations
-
(Seattle WA), Contemp. Math. 197, Amer. Math. Soc., Providence, RI
-
Dharmatilake, J., Amin-max theorem using matroid separations. In Matroid Theory (Seattle WA 1995), Contemp. Math. 197, Amer. Math. Soc., Providence, RI, 1996, 333-342.
-
(1995)
Matroid Theory
, pp. 333-342
-
-
Dharmatilake, J.1
-
6
-
-
0002681234
-
A class of geometric lattices based on finite groups
-
Dowling, T., A class of geometric lattices based on finite groups. J. Combin. Theory Ser. B 14 (1973), 61-86.
-
(1973)
J. Combin. Theory Ser. B
, vol.14
, pp. 61-86
-
-
Dowling, T.1
-
7
-
-
0002167079
-
Submodular functions, matroids, and certain polyhedra
-
(Proceedings Calgary International Conference on Combinatorial Structures and Their Applications, Calgary, Alberta), ed. by R. Guy, H. Hanani, N. Sauer, and J. Scho″nheim, Gordon and Breach, New York
-
Edmonds, J., Submodular functions, matroids, and certain polyhedra. In Combinatorial Structures and Their Applications (Proceedings Calgary International Conference on Combinatorial Structures and Their Applications, Calgary, Alberta, 1969), ed. by R. Guy, H. Hanani, N. Sauer, and J. Scho″nheim, Gordon and Breach, New York 1970, 69-87.
-
(1969)
Combinatorial Structures and Their Applications
, pp. 69-87
-
-
Edmonds, J.1
-
8
-
-
0003603813
-
-
Freeman, San Fransisco
-
Garey, M. R., and Johnson, D. S., Computers and intractability: A guide to the theory of NP-completeness, Freeman, San Fransisco, 1979.
-
(1979)
Computers and Intractability: A Guide to the Theory of NP-completeness
-
-
Garey, M.R.1
Johnson, D.S.2
-
9
-
-
0001246052
-
The excluded minors for GF(4)- representable matroids
-
Geelen, J. F., Gerards, A. M. H., and Kapoor, A., The excluded minors for GF(4)- representable matroids. J. Combin. Theory Ser. B 79 (2000), 247-299.
-
(2000)
J. Combin. Theory Ser. B
, vol.79
, pp. 247-299
-
-
Geelen, J.F.1
Gerards, A.M.H.2
Kapoor, A.3
-
10
-
-
84878101391
-
Obstructions to branchdecomposition of matroids
-
Victoria University of Wellington
-
Geelen, J. F., Gerards, A. M. H., Robertson, N., and Whittle, G. P., Obstructions to branchdecomposition of matroids. Research Report 03-2, School of Mathematical and Computing Sciences, Victoria University ofWellington, 2004.
-
(2004)
Research Report 03-2, School of Mathematical and Computing Sciences
-
-
Geelen, J.F.1
Gerards, A.M.H.2
Robertson, N.3
Whittle, G.P.4
-
11
-
-
0038349568
-
On the excluded minors for the matroids of branch-width k
-
Geelen, J. F., Gerards, A. M. H., Robertson, N., and Whittle, G. P., On the excluded minors for the matroids of branch-width k. J. Combin. Theory Ser. B 88 (2003), 261-265.
-
(2003)
J. Combin. Theory Ser. B
, vol.88
, pp. 261-265
-
-
Geelen, J.F.1
Gerards, A.M.H.2
Robertson, N.3
Whittle, G.P.4
-
12
-
-
0036211275
-
Branch width and well-quasiordering in matroids and graphs
-
Geelen, James F., Gerards, A. M. H., and Whittle, Geoff, Branch width and well-quasiordering in matroids and graphs. J. Combin. Theory Ser. B 84 (2002), 270-290.
-
(2002)
J. Combin. Theory Ser. B
, vol.84
, pp. 270-290
-
-
Geelen, J.F.1
Gerards, A.M.H.2
Whittle, G.3
-
13
-
-
23244439890
-
Excluding a planar graph from GF(q)- representable matroids
-
Victoria University of Wellington
-
Geelen, Jim, Gerards, Bert, and Whittle, Geoff, Excluding a planar graph from GF(q)- representable matroids. Research Report 03-4, School of Mathematical and Computing Sciences, Victoria University ofWellington, 2003.
-
(2003)
Research Report 03-4, School of Mathematical and Computing Sciences
-
-
Geelen, J.1
Gerards, B.2
Whittle, G.3
-
14
-
-
21844458779
-
-
In preparation
-
Geelen, Jim, Gerards, Bert, and Whittle, Geoff, Inequivalent representations of matroids I: An overview. In preparation, 2005.
-
(2005)
Inequivalent Representations of Matroids I: An Overview
-
-
Geelen, J.1
Gerards, B.2
Whittle, G.3
-
15
-
-
84878094102
-
-
In preparation
-
Geelen, Jim, Gerards, Bert, and Whittle, Geoff, Inequivalent representations of matroids II: k-coherent matroids. In preparation, 2004.
-
(2004)
Inequivalent Representations of Matroids II: K-coherent Matroids
-
-
Geelen, J.1
Gerards, B.2
Whittle, G.3
-
16
-
-
38049029854
-
Tangles, tree-decompositions, and grids in matroids
-
Victoria University of Wellington
-
Geelen, Jim, Gerards, Bert, and Whittle, Geoff, Tangles, tree-decompositions, and grids in matroids. Research Report 04-5, School of Mathematical and Computing Sciences, Victoria University of Wellington, 2004.
-
(2004)
Research Report 04-5, School of Mathematical and Computing Sciences
-
-
Geelen, J.1
Gerards, B.2
Whittle, G.3
-
17
-
-
0036845478
-
Branch width and Rota's conjecture
-
Geelen, J., and Whittle, G., Branch width and Rota's conjecture. J. Combin. Theory Ser. B 86 (2002), 215-330.
-
(2002)
J. Combin. Theory Ser. B
, vol.86
, pp. 215-330
-
-
Geelen, J.1
Whittle, G.2
-
20
-
-
0002013145
-
Integral boundary points of convex polyhedra
-
(ed. by H. W. Kuhn and A. W. Tucker), Ann. of Math. Stud. 38, Princeton University Press, Princeton, N.J.
-
Hoffman, A. J., and Kruskal, J. B., Integral boundary points of convex polyhedra. In Linear Inequalities and Related Systems (ed. by H. W. Kuhn and A. W. Tucker), Ann. of Math. Stud. 38, Princeton University Press, Princeton, N.J., 1956, 223-246.
-
(1956)
Linear Inequalities and Related Systems
, pp. 223-246
-
-
Hoffman, A.J.1
Kruskal, J.B.2
-
22
-
-
0000157130
-
Sur le problème des courbes gauches en topologie
-
Kuratowski, C., Sur le problème des courbes gauches en topologie. Fund. Math. 15 (1930), 271-283.
-
(1930)
Fund. Math.
, vol.15
, pp. 271-283
-
-
Kuratowski, C.1
-
23
-
-
84963024014
-
The representation problem for independence functions
-
Lazarson, T., The representation problem for independence functions. J. London Math. Soc. 33 (1958), 21-25.
-
(1958)
J. London Math. Soc.
, vol.33
, pp. 21-25
-
-
Lazarson, T.1
-
24
-
-
0002439168
-
Zur allgemeinen Kurventheorie
-
Menger, K., Zur allgemeinen Kurventheorie. Fund. Math. 10 (1927), 96-115.
-
(1927)
Fund. Math.
, vol.10
, pp. 96-115
-
-
Menger, K.1
-
25
-
-
0004061262
-
-
Oxford University Press, New York
-
Oxley, J. G., Matroid theory. Oxford University Press, New York, 1992.
-
(1992)
Matroid Theory
-
-
Oxley, J.G.1
-
26
-
-
3042806238
-
Graph Minors. IV. Tree-width and well-quasiordering
-
Robertson, Neil, and Seymour, P. D., Graph Minors. IV. Tree-width and well-quasiordering. J. Combin. Theory Ser. B 48 (1990), 227-254.
-
(1990)
J. Combin. Theory Ser. B
, vol.48
, pp. 227-254
-
-
Robertson, N.1
Seymour, P.D.2
-
27
-
-
0002856269
-
Excluding a planar graph
-
Robertson, Neil, and Seymour, P.D., Graph Minors.V. Excluding a planar graph. J. Combin. Theory Ser. B 41 (1986), 92-114.
-
(1986)
J. Combin. Theory Ser. B
, vol.41
, pp. 92-114
-
-
Robertson, N.1
Seymour, P.D.2
Graph Minors, V.3
-
28
-
-
0001227241
-
Graph Minors X. Obstructions to tree-decomposition
-
Robertson, Neil, and Seymour, P.D., Graph Minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52 (1991), 153-190.
-
(1991)
J. Combin. Theory Ser. B
, vol.52
, pp. 153-190
-
-
Robertson, N.1
Seymour, P.D.2
-
29
-
-
0002848005
-
Graph Minors. XIII. The disjoint paths problem
-
Robertson, Neil, and Seymour, P. D., Graph Minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B 63 (1995), 65-110.
-
(1995)
J. Combin. Theory Ser. B
, vol.63
, pp. 65-110
-
-
Robertson, N.1
Seymour, P.D.2
-
30
-
-
0141538200
-
Graph Minors. XVI. Excluding a non-planar graph
-
Robertson, Neil, and Seymour, P. D., Graph Minors. XVI. Excluding a non-planar graph. J. Combin. Theory Ser. B 89 (2003), 43-76.
-
(2003)
J. Combin. Theory Ser. B
, vol.89
, pp. 43-76
-
-
Robertson, N.1
Seymour, P.D.2
-
32
-
-
0004455288
-
Quickly excluding a planar graph
-
Robertson, Neil, Seymour, Paul, and Thomas, Robin, Quickly excluding a planar graph. J. Combin. Theory Ser. B 62 (1994), 323-348.
-
(1994)
J. Combin. Theory Ser. B
, vol.62
, pp. 323-348
-
-
Robertson, N.1
Seymour, P.2
Thomas, R.3
-
33
-
-
0011518480
-
Combinatorial theory, old and new
-
(Nice), Gauthier-Villars, Paris 1970
-
Rota, G.-C., Combinatorial theory, old and new. In Actes du Congrès International de Mathématiciens (Nice, 1970), vol. 3, Gauthier-Villars, Paris 1970, 229-233.
-
(1970)
Actes du Congrès International de Mathématiciens
, vol.3
, pp. 229-233
-
-
Rota, G.-C.1
-
36
-
-
49149147896
-
Decomposition of regular matroids
-
Seymour, P. D., Decomposition of regular matroids. J. Combin. Theory Ser. B 28 (1980), 305-359.
-
(1980)
J. Combin. Theory Ser. B
, vol.28
, pp. 305-359
-
-
Seymour, P.D.1
-
37
-
-
0001523212
-
Matroid representation over GF(3)
-
Seymour, P. D., Matroid representation over GF(3). J. Combin. Theory Ser. B 26 (1979), 159-173.
-
(1979)
J. Combin. Theory Ser. B
, vol.26
, pp. 159-173
-
-
Seymour, P.D.1
-
38
-
-
51249186893
-
Recognizing graphic matroids
-
Seymour, P. D., Recognizing graphic matroids. Combinatorica 1 (1981), 75-78.
-
(1981)
Combinatorica
, vol.1
, pp. 75-78
-
-
Seymour, P.D.1
-
40
-
-
84968508683
-
A homotopy theorem for matroids I, II
-
Tutte, W. T., A homotopy theorem for matroids I, II. Trans. Amer. Math. Soc. 88 (1958), 144-174.
-
(1958)
Trans. Amer. Math. Soc.
, vol.88
, pp. 144-174
-
-
Tutte, W.T.1
-
41
-
-
84968482153
-
An algorithm for determining whether a given binary matroid is graphic
-
Tutte, W. T., An algorithm for determining whether a given binary matroid is graphic. Proc. Amer. Math. Soc. 11 (1960), 905-917.
-
(1960)
Proc. Amer. Math. Soc.
, vol.11
, pp. 905-917
-
-
Tutte, W.T.1
-
44
-
-
15544389538
-
A mathematical bibliography of signed and gain graphs and allied areas. Manuscript prepared with Marge Pratt
-
Dynamic Surveys 8
-
T. Zaslavsky, A mathematical bibliography of signed and gain graphs and allied areas. Manuscript prepared with Marge Pratt, Electron. J. Combin. 5 (1999), Dynamic Surveys 8, 124 pp.
-
(1999)
Electron. J. Combin.
, vol.5
-
-
Zaslavsky, T.1
-
45
-
-
0002766745
-
Biased graphs. II. The three matroids
-
Zaslavsky, T., Biased graphs. II. The three matroids. J. Combin. Theory Ser. B 51 (1991), 46-72.
-
(1991)
J. Combin. Theory Ser. B
, vol.51
, pp. 46-72
-
-
Zaslavsky, T.1
|