According to our database
1,
Thomas Zaslavsky
authored at least 71 papers
between 1976 and 2024.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2024
Cobiased Graphs: Single-Element Extensions and Elementary Quotients of Graphic Matroids.
Electron. J. Comb., 2024
2022
2021
Homomorphisms of signed graphs: An update.
Eur. J. Comb., 2021
The characteristic polynomial of a graph containing loops.
Discret. Appl. Math., 2021
Characterizations of some parity signed graphs.
Australas. J Comb., 2021
2020
A q-Queens Problem IV. Attacking configurations and their denominators.
Discret. Math., 2020
Strongly connectable digraphs and non-transitive dice.
AKCE Int. J. Graphs Comb., 2020
A q-queens problem VII: Combinatorial types of nonattacking chess riders.
Australas. J Comb., 2020
Projective planarity of matroids of 3-nets and biased graphs.
Australas. J Comb., 2020
2019
Biased graphs. VI. synthetic geometry.
Eur. J. Comb., 2019
The dimension of the negative cycle vectors of a signed graph.
Ars Math. Contemp., 2019
A <i>q</i>-queens problem. VI. The bishops' period.
Ars Math. Contemp., 2019
A <i>q</i>-queens problem III. Nonattacking partial queens.
Australas. J Comb., 2019
2018
Negative (and positive) circles in signed graphs: A problem collection.
AKCE Int. J. Graphs Comb., 2018
2017
Negative Circles in Signed Graphs: A Problem Collection.
Electron. Notes Discret. Math., 2017
Forbidden Induced Subgraphs.
Electron. Notes Discret. Math., 2017
Electron. Notes Discret. Math., 2017
Resolution of indecomposable integral flows on signed graphs.
Discret. Math., 2017
2016
Lattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphs.
J. Comb. Theory, Ser. B, 2016
The dynamic of the forest graph operator.
Discuss. Math. Graph Theory, 2016
2015
Characterization of line-consistent signed graphs.
Discuss. Math. Graph Theory, 2015
2014
A q-Queens Problem. I. General Theory.
Electron. J. Comb., 2014
2013
Which Exterior Powers are Balanced?
Electron. J. Comb., 2013
2012
Six signed Petersen graphs, and their automorphisms.
Discret. Math., 2012
2009
Totally frustrated states in the chromatic theory of gain graphs.
Eur. J. Comb., 2009
On the division of space by topological hyperplanes.
Eur. J. Comb., 2009
An Elementary Chromatic Reduction for Gain Graphs and Special Hyperplane Arrangements.
Electron. J. Comb., 2009
2007
Biased graphs. VII. Contrabalance and antivoltages.
J. Comb. Theory, Ser. B, 2007
Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements.
J. Comb. Theory, Ser. A, 2007
2006
Magic Squares and Nontransitive Dice: 11099.
Am. Math. Mon., 2006
A simple algorithm that proves half-integrality of bidirected network programming.
Networks, 2006
Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups.
J. Graph Theory, 2006
The number of nowhere-zero flows on graphs and signed graphs.
J. Comb. Theory, Ser. B, 2006
2005
Criteria for Balance in Abelian Gain Graphs, with Applications to Piecewise-Linear Geometry.
Discret. Comput. Geom., 2005
2004
Periodicity in Quasipolynomial Convolution.
Electron. J. Comb., 2004
2003
Biased graphs IV: Geometrical realizations.
J. Comb. Theory, Ser. B, 2003
A Meshalkin theorem for projective geometries.
J. Comb. Theory, Ser. A, 2003
2002
A Shorter, Simpler, Stronger Proof of the Meshalkin-Hochberg-Hirsch Bounds on Componentwise Antichains.
J. Comb. Theory, Ser. A, 2002
Perpendicular Dissections of Space.
Discret. Comput. Geom., 2002
2001
Supersolvable Frame-matroid and Graphic-lift Lattices.
Eur. J. Comb., 2001
The largest demigenus of a bipartite signed graph.
Discret. Math., 2001
1998
Signed analogs of bipartite graphs.
Discret. Math., 1998
1997
The Largest Parity Demigenus of a Simple Graph.
J. Comb. Theory, Ser. B, 1997
Is There a Matroid Theory of Signed Graph Embedding?
Ars Comb., 1997
1996
The Order Upper Bound on Parity Embedding of a Graph.
J. Comb. Theory, Ser. B, 1996
1995
The Signed Chromatic Number of the Projective Plane and Klein Bottle and Antipodal Graph Coloring.
J. Comb. Theory, Ser. B, 1995
Biased Graphs .III. Chromatic and Dichromatic Invariants.
J. Comb. Theory, Ser. B, 1995
1994
A Coding Approach to Signed Graphs.
SIAM J. Discret. Math., 1994
Frame Matroids and Biased Graphs.
Eur. J. Comb., 1994
Maximality of the cycle code of a graph.
Discret. Math., 1994
1993
The projective-planar signed graphs.
Discret. Math., 1993
The Covering Radius of the Cycle Code of a Graph.
Discret. Appl. Math., 1993
1992
Orientation embedding of signed graphs.
J. Graph Theory, 1992
1991
Biased graphs. II. The three matroids.
J. Comb. Theory, Ser. B, 1991
Orientation of Signed Graphs.
Eur. J. Comb., 1991
1990
Biased graphs whose matroids are special binary matroids.
Graphs Comb., 1990
1989
Biased graphs. I. Bias, balance, and gains.
J. Comb. Theory, Ser. B, 1989
1987
The biased graphs whose matroids are binary.
J. Comb. Theory, Ser. B, 1987
Balanced decompositions of a signed graph.
J. Comb. Theory, Ser. B, 1987
1984
How colorful the signed graph?
Discret. Math., 1984
1983
Signed graphs: To: T. Zaslausky, Discrete Appl. Math 4 (1982) 47-74.
Discret. Appl. Math., 1983
1982
Chromatic invariants of signed graphs.
Discret. Math., 1982
Discret. Appl. Math., 1982
1981
Characterizations of signed graphs.
J. Graph Theory, 1981
Correction to "Complementary Matching Vectors and the Uniform Matching Extension Property".
Eur. J. Comb., 1981
Complementary Matching Vectors and the Uniform Matching Extension Property.
Eur. J. Comb., 1981
1976
Maximal Dissections of a Simplex.
J. Comb. Theory, Ser. A, 1976
