Thomas Zaslavsky

Publication Activity (10 Years)

Years Active: 1976-2024
Publications (10 Years): 22

Top Topics

Negatively Correlated

Distributive Lattices

Structured Objects

Top Venues

Australas. J Comb.

Electron. Notes Discret. Math.

Electron. J. Comb.

Publications

Daniel C. Slilaty, Thomas Zaslavsky
Cobiased Graphs: Single-Element Extensions and Elementary Quotients of Graphic Matroids. Electron. J. Comb. 31 (1) (2024)
Vaidy Sivaraman, Thomas Zaslavsky
Two Hamiltonian cycles. Discret. Math. 345 (5) (2022)
Deepa Sinha, Bableen Kaur, Thomas Zaslavsky
The characteristic polynomial of a graph containing loops. Discret. Appl. Math. 300 (2021)
Mukti Acharya, Joseph Varghese Kureethara, Thomas Zaslavsky
Characterizations of some parity signed graphs. Australas. J Comb. 81 (2021)
Reza Naserasr, Éric Sopena, Thomas Zaslavsky
Homomorphisms of signed graphs: An update. Eur. J. Comb. 91 (2021)
Christopher R. H. Hanusa, Thomas Zaslavsky
A q-queens problem VII: Combinatorial types of nonattacking chess riders. Australas. J Comb. 77 (2020)
Rigoberto Flórez, Thomas Zaslavsky
Projective planarity of matroids of 3-nets and biased graphs. Australas. J Comb. 76 (2020)
Simon Joyce, Alex Schaefer, Douglas B. West, Thomas Zaslavsky
Strongly connectable digraphs and non-transitive dice. AKCE Int. J. Graphs Comb. 17 (1) (2020)
Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky
A q-Queens Problem IV. Attacking configurations and their denominators. Discret. Math. 343 (2) (2020)
Alex Schaefer, Thomas Zaslavsky
The dimension of the negative cycle vectors of a signed graph. Ars Math. Contemp. 16 (2) (2019)
Rigoberto Flórez, Thomas Zaslavsky
Biased graphs. VI. synthetic geometry. Eur. J. Comb. 81 (2019)
Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky
-queens problem. VI. The bishops' period. Ars Math. Contemp. 16 (2) (2019)
Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky
-queens problem III. Nonattacking partial queens. Australas. J Comb. 74 (2019)
Richard Behr, Vaidy Sivaraman, Thomas Zaslavsky
Mock threshold graphs. Discret. Math. 341 (8) (2018)
Thomas Zaslavsky
Negative (and positive) circles in signed graphs: A problem collection. AKCE Int. J. Graphs Comb. 15 (1) (2018)
Thomas Zaslavsky
Negative Circles in Signed Graphs: A Problem Collection. Electron. Notes Discret. Math. 63 (2017)
Deepa Sinha, Thomas Zaslavsky, Gyula O. H. Katona, Tao-Ming Wang
Preface. Electron. Notes Discret. Math. 63 (2017)
Beifang Chen, Jue Wang, Thomas Zaslavsky
Resolution of indecomposable integral flows on signed graphs. Discret. Math. 340 (6) (2017)
Thomas Zaslavsky
Forbidden Induced Subgraphs. Electron. Notes Discret. Math. 63 (2017)
David Forge, Thomas Zaslavsky
Lattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphs. J. Comb. Theory, Ser. B 118 (2016)
Suresh Dara, Venkateshwarlu Deva, Suresh Manjanath Hegde, S. B. Rao, Thomas Zaslavsky
The dynamic of the forest graph operator. Discuss. Math. Graph Theory 36 (4) (2016)
Daniel C. Slilaty, Thomas Zaslavsky
Characterization of line-consistent signed graphs. Discuss. Math. Graph Theory 35 (3) (2015)
Seth Chaiken, Christopher R. H. Hanusa, Thomas Zaslavsky
A q-Queens Problem. I. General Theory. Electron. J. Comb. 21 (3) (2014)
Devlin Mallory, Abigail Raz, Christino Tamon, Thomas Zaslavsky
Which Exterior Powers are Balanced? Electron. J. Comb. 20 (2) (2013)
Thomas Zaslavsky
Six signed Petersen graphs, and their automorphisms. Discret. Math. 312 (9) (2012)
R. Balakrishnan, R. B. Bapat, Sandi Klavzar, Ambat Vijayakumar, Thomas Zaslavsky, Xuding Zhu
Preface. Discret. Math. 312 (9) (2012)
Pascal Berthomé, Raul Cordovil, David Forge, Véronique Ventos, Thomas Zaslavsky
An Elementary Chromatic Reduction for Gain Graphs and Special Hyperplane Arrangements. Electron. J. Comb. 16 (1) (2009)
Thomas Zaslavsky
Totally frustrated states in the chromatic theory of gain graphs. Eur. J. Comb. 30 (1) (2009)
David Forge, Thomas Zaslavsky
On the division of space by topological hyperplanes. Eur. J. Comb. 30 (8) (2009)
Thomas Zaslavsky
Biased graphs. VII. Contrabalance and antivoltages. J. Comb. Theory, Ser. B 97 (6) (2007)
David Forge, Thomas Zaslavsky
Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements. J. Comb. Theory, Ser. A 114 (1) (2007)
Matthias Beck, Thomas Zaslavsky
The number of nowhere-zero flows on graphs and signed graphs. J. Comb. Theory, Ser. B 96 (6) (2006)
Ethan D. Bolker, Thomas Zaslavsky
A simple algorithm that proves half-integrality of bidirected network programming. Networks 48 (1) (2006)
Matthias Beck, Richard Ehrenborg, Thomas Zaslavsky, Michael Avidon, John H. Lindsey II
Magic Squares and Nontransitive Dice: 11099. Am. Math. Mon. 113 (5) (2006)
Konstantin A. Rybnikov, Thomas Zaslavsky
Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups. J. Graph Theory 51 (1) (2006)
Konstantin A. Rybnikov, Thomas Zaslavsky
Criteria for Balance in Abelian Gain Graphs, with Applications to Piecewise-Linear Geometry. Discret. Comput. Geom. 34 (2) (2005)
Thomas Zaslavsky
Periodicity in Quasipolynomial Convolution. Electron. J. Comb. 11 (2) (2004)
Matthias Beck, Richard Ehrenborg, Thomas Zaslavsky
Problem 11099. Am. Math. Mon. 111 (7) (2004)
Matthias Beck, Thomas Zaslavsky
A Meshalkin theorem for projective geometries. J. Comb. Theory, Ser. A 102 (2) (2003)
Thomas Zaslavsky
Biased graphs IV: Geometrical realizations. J. Comb. Theory, Ser. B 89 (2) (2003)
Thomas Zaslavsky
Perpendicular Dissections of Space. Discret. Comput. Geom. 27 (3) (2002)
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) (2002)
Thomas Zaslavsky
The largest demigenus of a bipartite signed graph. Discret. Math. 232 (1-3) (2001)
Thomas Zaslavsky
Supersolvable Frame-matroid and Graphic-lift Lattices. Eur. J. Comb. 22 (1) (2001)
Thomas Zaslavsky
Signed analogs of bipartite graphs. Discret. Math. 179 (1-3) (1998)
Thomas Zaslavsky
Is There a Matroid Theory of Signed Graph Embedding? Ars Comb. 45 (1997)
Thomas Zaslavsky
The Largest Parity Demigenus of a Simple Graph. J. Comb. Theory, Ser. B 70 (2) (1997)
Thomas Zaslavsky
The Order Upper Bound on Parity Embedding of a Graph. J. Comb. Theory, Ser. B 68 (1) (1996)
Thomas Zaslavsky
The Signed Chromatic Number of the Projective Plane and Klein Bottle and Antipodal Graph Coloring. J. Comb. Theory, Ser. B 63 (1) (1995)
Thomas Zaslavsky
Biased Graphs .III. Chromatic and Dichromatic Invariants. J. Comb. Theory, Ser. B 64 (1) (1995)
Patrick Solé, Thomas Zaslavsky
A Coding Approach to Signed Graphs. SIAM J. Discret. Math. 7 (4) (1994)
Patrick Solé, Thomas Zaslavsky
Maximality of the cycle code of a graph. Discret. Math. 128 (1-3) (1994)
Thomas Zaslavsky
Frame Matroids and Biased Graphs. Eur. J. Comb. 15 (3) (1994)
Patrick Solé, Thomas Zaslavsky
The Covering Radius of the Cycle Code of a Graph. Discret. Appl. Math. 45 (1) (1993)
Thomas Zaslavsky
The projective-planar signed graphs. Discret. Math. 113 (1-3) (1993)
Thomas Zaslavsky
Orientation embedding of signed graphs. J. Graph Theory 16 (5) (1992)
Thomas Zaslavsky
Orientation of Signed Graphs. Eur. J. Comb. 12 (4) (1991)
Thomas Zaslavsky
Biased graphs. II. The three matroids. J. Comb. Theory, Ser. B 51 (1) (1991)
Thomas Zaslavsky
Biased graphs whose matroids are special binary matroids. Graphs Comb. 6 (1) (1990)
Thomas Zaslavsky
Biased graphs. I. Bias, balance, and gains. J. Comb. Theory, Ser. B 47 (1) (1989)
Thomas Zaslavsky
The biased graphs whose matroids are binary. J. Comb. Theory, Ser. B 42 (3) (1987)
Thomas Zaslavsky
Balanced decompositions of a signed graph. J. Comb. Theory, Ser. B 43 (1) (1987)
Thomas Zaslavsky
How colorful the signed graph? Discret. Math. 52 (2-3) (1984)
Thomas Zaslavsky
Signed graphs: To: T. Zaslausky, Discrete Appl. Math 4 (1982) 47-74. Discret. Appl. Math. 5 (2) (1983)
Thomas Zaslavsky
Chromatic invariants of signed graphs. Discret. Math. 42 (2-3) (1982)
Thomas Zaslavsky
Signed graph coloring. Discret. Math. 39 (2) (1982)
Thomas Zaslavsky
Signed graphs. Discret. Appl. Math. 4 (1) (1982)
Thomas Zaslavsky
Characterizations of signed graphs. J. Graph Theory 5 (4) (1981)
Thomas Zaslavsky
Complementary Matching Vectors and the Uniform Matching Extension Property. Eur. J. Comb. 2 (1) (1981)
Thomas Zaslavsky
Correction to "Complementary Matching Vectors and the Uniform Matching Extension Property". Eur. J. Comb. 2 (3) (1981)
Thomas Zaslavsky
Maximal Dissections of a Simplex. J. Comb. Theory, Ser. A 20 (2) (1976)