Maximal Dissections of a Simplex. - Thomas Zaslavsky (J. Comb. Theory A, 1976)

Complementary Matching Vectors and the Uniform Matching Extension Property. - Thomas Zaslavsky (Eur. J. Comb., 1981)

Correction to "Complementary Matching Vectors and the Uniform Matching Extension Property". - Thomas Zaslavsky (Eur. J. Comb., 1981)

Characterizations of signed graphs. - Thomas Zaslavsky (J. Graph Theory, 1981)

Signed graphs. - Thomas Zaslavsky (Discret. Appl. Math., 1982)

Signed graph coloring. - Thomas Zaslavsky (Discret. Math., 1982)

Chromatic invariants of signed graphs. - Thomas Zaslavsky (Discret. Math., 1982)

Signed graphs: To: T. Zaslausky, Discrete Appl. Math 4 (1982) 47-74. - Thomas Zaslavsky (Discret. Appl. Math., 1983)

How colorful the signed graph? - Thomas Zaslavsky (Discret. Math., 1984)

Balanced decompositions of a signed graph. - Thomas Zaslavsky (J. Comb. Theory B, 1987)

The biased graphs whose matroids are binary. - Thomas Zaslavsky (J. Comb. Theory B, 1987)

Biased graphs. I. Bias, balance, and gains. - Thomas Zaslavsky (J. Comb. Theory B, 1989)

Biased graphs whose matroids are special binary matroids. - Thomas Zaslavsky (Graphs Comb., 1990)

Orientation of Signed Graphs. - Thomas Zaslavsky (Eur. J. Comb., 1991)

Biased graphs. II. The three matroids. - Thomas Zaslavsky (J. Comb. Theory B, 1991)

Orientation embedding of signed graphs. - Thomas Zaslavsky (J. Graph Theory, 1992)

The Covering Radius of the Cycle Code of a Graph. - Patrick Solé; Thomas Zaslavsky (Discret. Appl. Math., 1993)

The projective-planar signed graphs. - Thomas Zaslavsky (Discret. Math., 1993)

Maximality of the cycle code of a graph. - Patrick Solé; Thomas Zaslavsky (Discret. Math., 1994)

Frame Matroids and Biased Graphs. - Thomas Zaslavsky (Eur. J. Comb., 1994)

A Coding Approach to Signed Graphs. - Patrick Solé; Thomas Zaslavsky (SIAM J. Discret. Math., 1994)

Biased Graphs .III. Chromatic and Dichromatic Invariants. - Thomas Zaslavsky (J. Comb. Theory B, 1995)

The Signed Chromatic Number of the Projective Plane and Klein Bottle and Antipodal Graph Coloring. - Thomas Zaslavsky (J. Comb. Theory B, 1995)

The Order Upper Bound on Parity Embedding of a Graph. - Thomas Zaslavsky (J. Comb. Theory, Ser. B, 1996)

Is There a Matroid Theory of Signed Graph Embedding? - Thomas Zaslavsky (Ars Comb., 1997)

The Largest Parity Demigenus of a Simple Graph. - Thomas Zaslavsky (J. Comb. Theory B, 1997)

Signed analogs of bipartite graphs. - Thomas Zaslavsky (Discret. Math., 1998)

The largest demigenus of a bipartite signed graph. - Thomas Zaslavsky (Discret. Math., 2001)

Supersolvable Frame-matroid and Graphic-lift Lattices. - Thomas Zaslavsky (Eur. J. Comb., 2001)

Perpendicular Dissections of Space. - Thomas Zaslavsky (Discret. Comput. Geom., 2002)

A Shorter, Simpler, Stronger Proof of the Meshalkin-Hochberg-Hirsch Bounds on Componentwise Antichains. - Matthias Beck; Thomas Zaslavsky (J. Comb. Theory A, 2002)

A Meshalkin theorem for projective geometries. - Matthias Beck; Thomas Zaslavsky (J. Comb. Theory A, 2003)

Biased graphs IV: Geometrical realizations. - Thomas Zaslavsky (J. Comb. Theory B, 2003)

Periodicity in Quasipolynomial Convolution. - Thomas Zaslavsky (Electron. J. Comb., 2004)

Problem 11099. - Matthias Beck; Richard Ehrenborg; Thomas Zaslavsky (Am. Math. Mon., 2004)

Criteria for Balance in Abelian Gain Graphs, with Applications to Piecewise-Linear Geometry. - Konstantin A. Rybnikov; Thomas Zaslavsky (Discret. Comput. Geom., 2005)

The number of nowhere-zero flows on graphs and signed graphs. - Matthias Beck; Thomas Zaslavsky (J. Comb. Theory B, 2006)

Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups. - Konstantin A. Rybnikov; Thomas Zaslavsky (J. Graph Theory, 2006)

A simple algorithm that proves half-integrality of bidirected network programming. - Ethan D. Bolker; Thomas Zaslavsky (Networks, 2006)

Magic Squares and Nontransitive Dice: 11099. - Matthias Beck; Richard Ehrenborg; Thomas Zaslavsky; Michael Avidon; John H. Lindsey II (Am. Math. Mon., 2006)

Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements. - David Forge; Thomas Zaslavsky (J. Comb. Theory A, 2007)

Biased graphs. VII. Contrabalance and antivoltages. - Thomas Zaslavsky (J. Comb. Theory B, 2007)

An Elementary Chromatic Reduction for Gain Graphs and Special Hyperplane Arrangements. - Pascal Berthomé; Raul Cordovil; David Forge; Véronique Ventos; Thomas Zaslavsky (Electron. J. Comb., 2009)

On the division of space by topological hyperplanes. - David Forge; Thomas Zaslavsky (Eur. J. Comb., 2009)

Totally frustrated states in the chromatic theory of gain graphs. - Thomas Zaslavsky (Eur. J. Comb., 2009)

Preface. - R. Balakrishnan; R. B. Bapat 001; Sandi Klavzar; Ambat Vijayakumar; Thomas Zaslavsky; Xuding Zhu (Discret. Math., 2012)

Six signed Petersen graphs, and their automorphisms. - Thomas Zaslavsky (Discret. Math., 2012)

Which Exterior Powers are Balanced? - Devlin Mallory; Abigail Raz; Christino Tamon; Thomas Zaslavsky (Electron. J. Comb., 2013)

A q-Queens Problem. I. General Theory. - Seth Chaiken; Christopher R. H. Hanusa; Thomas Zaslavsky (Electron. J. Comb., 2014)

Characterization of line-consistent signed graphs. - Daniel C. Slilaty; Thomas Zaslavsky (Discuss. Math. Graph Theory, 2015)

The dynamic of the forest graph operator. - Suresh Dara 002; Venkateshwarlu Deva; Suresh Manjanath Hegde; S. B. Rao; Thomas Zaslavsky (Discuss. Math. Graph Theory, 2016)

Lattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphs. - David Forge; Thomas Zaslavsky (J. Comb. Theory B, 2016)

Resolution of indecomposable integral flows on signed graphs. - Beifang Chen; Jue Wang; Thomas Zaslavsky (Discret. Math., 2017)

Preface. - Deepa Sinha; Thomas Zaslavsky; Gyula O. H. Katona; Tao-Ming Wang (Electron. Notes Discret. Math., 2017)

Forbidden Induced Subgraphs. - Thomas Zaslavsky (Electron. Notes Discret. Math., 2017)

Negative Circles in Signed Graphs: A Problem Collection. - Thomas Zaslavsky (Electron. Notes Discret. Math., 2017)

Negative (and positive) circles in signed graphs: A problem collection. - Thomas Zaslavsky (AKCE Int. J. Graphs Comb., 2018)

Mock threshold graphs. - Richard Behr; Vaidy Sivaraman; Thomas Zaslavsky (Discret. Math., 2018)

A q-queens problem III. Nonattacking partial queens. - Seth Chaiken; Christopher R. H. Hanusa; Thomas Zaslavsky (Australas. J Comb., 2019)

A q-queens problem. VI. The bishops' period. - Seth Chaiken; Christopher R. H. Hanusa; Thomas Zaslavsky (Ars Math. Contemp., 2019)

The dimension of the negative cycle vectors of a signed graph. - Alex Schaefer; Thomas Zaslavsky (Ars Math. Contemp., 2019)

Biased graphs. VI. synthetic geometry. - Rigoberto Flórez; Thomas Zaslavsky (Eur. J. Comb., 2019)

Projective planarity of matroids of 3-nets and biased graphs. - Rigoberto Flórez; Thomas Zaslavsky (Australas. J Comb., 2020)

A q-queens problem VII: Combinatorial types of nonattacking chess riders. - Christopher R. H. Hanusa; Thomas Zaslavsky (Australas. J Comb., 2020)

Strongly connectable digraphs and non-transitive dice. - Simon Joyce; Alex Schaefer; Douglas B. West; Thomas Zaslavsky (AKCE Int. J. Graphs Comb., 2020)

A q-Queens Problem IV. Attacking configurations and their denominators. - Seth Chaiken; Christopher R. H. Hanusa; Thomas Zaslavsky (Discret. Math., 2020)

Characterizations of some parity signed graphs. - Mukti Acharya; Joseph Varghese Kureethara; Thomas Zaslavsky (Australas. J Comb., 2021)

The characteristic polynomial of a graph containing loops. - Deepa Sinha; Bableen Kaur; Thomas Zaslavsky (Discret. Appl. Math., 2021)

Homomorphisms of signed graphs: An update. - Reza Naserasr; Éric Sopena; Thomas Zaslavsky (Eur. J. Comb., 2021)

Two Hamiltonian cycles. - Vaidy Sivaraman; Thomas Zaslavsky (Discret. Math., 2022)

Cobiased Graphs: Single-Element Extensions and Elementary Quotients of Graphic Matroids. - Daniel C. Slilaty; Thomas Zaslavsky (Electron. J. Comb., 2024)

Matroids of Gain Signed Graphs. - Laura Anderson; Ting Su; Thomas Zaslavsky (Discret. Comput. Geom., 2024)