Thomas Zaslavsky

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