 | 2009 |
|---|
| 32 |       | Thomas Zaslavsky:
Totally frustrated states in the chromatic theory of gain graphs.
Eur. J. Comb. 30(1): 133-156 (2009) |
| 2007 |
|---|
| 31 | | David Forge,
Thomas Zaslavsky:
Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements.
J. Comb. Theory, Ser. A 114(1): 97-109 (2007) |
| 30 | | Thomas Zaslavsky:
Biased graphs. VII. Contrabalance and antivoltages.
J. Comb. Theory, Ser. B 97(6): 1019-1040 (2007) |
| 2006 |
|---|
| 29 | | Matthias Beck,
Thomas Zaslavsky:
The number of nowhere-zero flows on graphs and signed graphs.
J. Comb. Theory, Ser. B 96(6): 901-918 (2006) |
| 28 | | Konstantin A. Rybnikov,
Thomas Zaslavsky:
Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups.
Journal of Graph Theory 51(1): 1-21 (2006) |
| 27 | | Ethan D. Bolker,
Thomas Zaslavsky:
A simple algorithm that proves half-integrality of bidirected network programming.
Networks 48(1): 36-38 (2006) |
| 2005 |
|---|
| 26 | | Konstantin A. Rybnikov,
Thomas Zaslavsky:
Criteria for Balance in Abelian Gain Graphs, with Applications to Piecewise-Linear Geometry.
Discrete & Computational Geometry 34(2): 251-268 (2005) |
| 2003 |
|---|
| 25 | | Matthias Beck,
Thomas Zaslavsky:
A Meshalkin theorem for projective geometries.
J. Comb. Theory, Ser. A 102(2): 433-441 (2003) |
| 24 | | Thomas Zaslavsky:
Biased graphs IV: Geometrical realizations.
J. Comb. Theory, Ser. B 89(2): 231-297 (2003) |
| 2002 |
|---|
| 23 | | Thomas Zaslavsky:
Perpendicular Dissections of Space.
Discrete & Computational Geometry 27(3): 303-351 (2002) |
| 22 | | Matthias Beck,
Thomas Zaslavsky:
A Shorter, Simpler, Stronger Proof of the Meshalkin-Hochberg-Hirsch Bounds on Componentwise Antichains.
J. Comb. Theory, Ser. A 100(1): 196-199 (2002) |
| 2001 |
|---|
| 21 | | Thomas Zaslavsky:
The largest demigenus of a bipartite signed graph.
Discrete Mathematics 232(1-3): 189-193 (2001) |
| 20 | | Thomas Zaslavsky:
Supersolvable Frame-matroid and Graphic-lift Lattices.
Eur. J. Comb. 22(1): 119-133 (2001) |
| 1998 |
|---|
| 19 | | Thomas Zaslavsky:
Signed analogs of bipartite graphs.
Discrete Mathematics 179(1-3): 205-216 (1998) |
| 1997 |
|---|
| 18 |  | Thomas Zaslavsky:
Is There a Matroid Theory of Signed Graph Embedding?
Ars Comb. 45: (1997) |
| 17 | | Thomas Zaslavsky:
The Largest Parity Demigenus of a Simple Graph.
J. Comb. Theory, Ser. B 70(2): 325-345 (1997) |
| 1996 |
|---|
| 16 | | Thomas Zaslavsky:
The Order Upper Bound on Parity Embedding of a Graph.
J. Comb. Theory, Ser. B 68(1): 149-160 (1996) |
| 1995 |
|---|
| 15 | | Thomas Zaslavsky:
The Signed Chromatic Number of the Projective Plane and Klein Bottle and Antipodal Graph Coloring.
J. Comb. Theory, Ser. B 63(1): 136-145 (1995) |
| 14 | | Thomas Zaslavsky:
Biased Graphs .III. Chromatic and Dichromatic Invariants.
J. Comb. Theory, Ser. B 64(1): 17-88 (1995) |
| 1994 |
|---|
| 13 | | Patrick Solé,
Thomas Zaslavsky:
Maximality of the cycle code of a graph.
Discrete Mathematics 128(1-3): 401-405 (1994) |
| 12 | | Thomas Zaslavsky:
Frame Matroids and Biased Graphs.
Eur. J. Comb. 15(3): 303-307 (1994) |
| 11 | | Patrick Solé,
Thomas Zaslavsky:
A Coding Approach to Signed Graphs.
SIAM J. Discrete Math. 7(4): 544-553 (1994) |
| 1993 |
|---|
| 10 | | Patrick Solé,
Thomas Zaslavsky:
The Covering Radius of the Cycle Code of a Graph.
Discrete Applied Mathematics 45(1): 63-70 (1993) |
| 9 | | Thomas Zaslavsky:
The projective-planar signed graphs.
Discrete Mathematics 113(1-3): 223-247 (1993) |
| 1991 |
|---|
| 8 | | Thomas Zaslavsky:
Biased graphs. II. The three matroids.
J. Comb. Theory, Ser. B 51(1): 46-72 (1991) |
| 1989 |
|---|
| 7 | | Thomas Zaslavsky:
Biased graphs. I. Bias, balance, and gains.
J. Comb. Theory, Ser. B 47(1): 32-52 (1989) |
| 1987 |
|---|
| 6 | | Thomas Zaslavsky:
The biased graphs whose matroids are binary.
J. Comb. Theory, Ser. B 42(3): 337-347 (1987) |
| 5 | | Thomas Zaslavsky:
Balanced decompositions of a signed graph.
J. Comb. Theory, Ser. B 43(1): 1-13 (1987) |
| 1984 |
|---|
| 4 | | Thomas Zaslavsky:
How colorful the signed graph?
Discrete Mathematics 52(2-3): 279-284 (1984) |
| 1982 |
|---|
| 3 | | Thomas Zaslavsky:
Signed graph coloring.
Discrete Mathematics 39(2): 215-228 (1982) |
| 2 | | Thomas Zaslavsky:
Chromatic invariants of signed graphs.
Discrete Mathematics 42(2-3): 287-312 (1982) |
| 1976 |
|---|
| 1 | | Thomas Zaslavsky:
Maximal Dissections of a Simplex.
J. Comb. Theory, Ser. A 20(2): 244-257 (1976) |
