Result 1 to 20 from 38 total
On minimally 3-connected binary matroids. (English)
Comb. Probab. Comput. 10, No.5, 453-461 (2001).
1
An included-minor result for 3-connected graphs with contractible edges. (English)
Discrete Math. 214, No.1-3, 291-297 (2000).
2
A generalization of a graph result of D. W. Hall. (English)
Discrete Math. 173, No.1-3, 129-135 (1997).
3
Unavoidable minors of large 3-connected binary matroids. (English)
J. Comb. Theory, Ser. B 66, No.2, 334-360 (1996).
4
Polynomial invariants of graphs with state models. (English)
Discrete Appl. Math. 56, No.2-3, 323-331 (1995).
5
Abstract rigidity in $m$-space. (English)
Barcelo, Hélène (ed.) et al., Jerusalem combinatorics ’93: an international conference in combinatorics, May 9-17, 1993, Jerusalem, Israel. Providence, RI: American Mathematical Society. Contemp. Math. 178, 145-151 (1994).
6
Is the four color theorem true? (English)
Geombinatorics 3, No.2, 41-56 (1993).
7
Planar graphs with no 6-wheel minor. (English)
Discrete Math. 120, No.1-3, 59-73 (1993).
8
A generalization of the Whitney rank generating function. (English)
Math. Proc. Camb. Philos. Soc. 113, No.2, 267-280 (1993).
9
Strong Tutte functions of matroids and graphs. (English)
Trans. Am. Math. Soc. 334, No.1, 317-347 (1992).
10
Matroid decomposition. (English)
Boston, MA: Academic Press, Inc.. x, 398 p. (revised electronic edition) (1992).
11
Extremal problems for cycle-connected graphs. (English)
Combinatorics, graph theory, and computing, Proc. 22nd Southeast Conf., Baton Rouge/LA (USA) 1991, Congr. Numerantium 83, 147-151 (1991).
12
Matroid theory and its applications in electric network theory and in statics. (English)
Algorithms and Combinatorics, 6. Berlin etc.: Springer-Verlag. XIII, 531 p. DM 138.00 (1989).
13
The long-line graph of a combinatorial geometry. I: Excluding $M(K\sb 4)$ and the $(q+2)$-point line as minors. (English)
Q. J. Math., Oxf. II. Ser. 39, No.154, 223-234 (1988).
14
Long paths and cycles in a random lattice. (English)
Random graphs ’85, Lect. 2nd Int. Semin., Poznań/Pol. 1985, Ann. Discrete Math. 33, 69-76 (1987).
15
Sufficient conditions for maximally connected dense graphs. (English)
Discrete Math. 63, 53-66 (1987).
16
Remarks on the graph colour theorem of Hajós. (English)
Combinatorics, graph theory, and computing, Proc. 17th Southeast. Conf., Boca Raton/Fl. 1986, Congr. Numerantium 55, 69-76 (1986).
17
Triples in matroid circuits. (English)
Eur. J. Comb. 7, 177-185 (1986).
18
Bichromaticity and domatic number of a bipartite graph. (English)
Čas. Pěst. Mat. 110, 113-115 (1985).
19
The chromatic number of the product of two $\aleph \sb 1$-chromatic graphs can be countable. (English)
Combinatorica 5, 137-139 (1985).
20
Result 1 to 20 from 38 total
Start
Contact
Print
General Help
