Thomas Zaslavsky

发表

Biased graphs. II. The three matroids

Thomas Zaslavsky, T. Zaslavsky, 1991, J. Comb. Theory, Ser. B.

A Meshalkin theorem for projective geometries

Thomas Zaslavsky, Matthias Beck, 2003, J. Comb. Theory, Ser. A.

Periodicity in Quasipolynomial Convolution

Thomas Zaslavsky, 2004, Electron. J. Comb..

Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements

Thomas Zaslavsky, David Forge, 2007, J. Comb. Theory, Ser. A.

Complementary Matching Vectors and the Uniform Matching Extension Property

Thomas Zaslavsky, 1981, Eur. J. Comb..

The Covering Radius of the Cycle Code of a Graph

Patrick Solé, Thomas Zaslavsky, T. Zaslavsky, 1993, Discret. Appl. Math..

A simple algorithm that proves half-integrality of bidirected network programming

Thomas Zaslavsky, Ethan D. Bolker, 2006, Networks.

Maximality of the cycle code of a graph

Patrick Solé, Thomas Zaslavsky, T. Zaslavsky, 1994, Discret. Math..

A q-queens problem. VI. The bishops' period

Thomas Zaslavsky, Seth Chaiken, Christopher R. H. Hanusa, 2019, Ars Math. Contemp..

The Dynamics of the Forest Graph Operator

Thomas Zaslavsky, S. B. Rao, Suresh Dara, 2016, Discuss. Math. Graph Theory.

Is There a Matroid Theory of Signed Graph Embedding?

Thomas Zaslavsky, T. Zaslavsky, 1997, Ars Comb..

A q-Queens Problem IV. Attacking configurations and their denominators

Thomas Zaslavsky, Seth Chaiken, Christopher R. H. Hanusa, 2020, Discret. Math..

Homomorphisms of signed graphs: An update

Thomas Zaslavsky, Eric Sopena, Reza Naserasr, 2019, Eur. J. Comb..

A Shorter, Simpler, Stronger Proof of the Meshalkin-Hochberg-Hirsch Bounds on Componentwise Antichains

Thomas Zaslavsky, Matthias Beck, 2002, J. Comb. Theory, Ser. A.

Problems: 10606-10612

Donald E. Knuth, Thomas Zaslavsky, Richard Hall, 1997 .

How colorful the signed graph?

Thomas Zaslavsky, T. Zaslavsky, 1984, Discret. Math..

Six signed Petersen graphs, and their automorphisms

Thomas Zaslavsky, T. Zaslavsky, 2012, Discret. Math..

Criteria for Balance in Abelian Gain Graphs, with Applications to Piecewise-Linear Geometry

Thomas Zaslavsky, Konstantin A. Rybnikov, T. Zaslavsky, 2002, Discret. Comput. Geom..

Resolution of indecomposable integral flows on signed graphs

Thomas Zaslavsky, Beifang Chen, Jue Wang, 2017, Discret. Math..

Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups

Thomas Zaslavsky, Konstantin A. Rybnikov, T. Zaslavsky, 2002, J. Graph Theory.

Preface

Gyula O. H. Katona, Deepa Sinha, Thomas Zaslavsky, 2017, Electron. Notes Discret. Math..

Totally frustrated states in the chromatic theory of gain graphs

Thomas Zaslavsky, 2009, Eur. J. Comb..

Biased Graphs .III. Chromatic and Dichromatic Invariants

Thomas Zaslavsky, 1995, J. Comb. Theory, Ser. B.

Orientation embedding of signed graphs

Thomas Zaslavsky, T. Zaslavsky, 1992, J. Graph Theory.

Biased graphs whose matroids are special binary matroids

Thomas Zaslavsky, T. Zaslavsky, 1990, Graphs Comb..

The largest demigenus of a bipartite signed graph

Thomas Zaslavsky, 2001, Discret. Math..

Frame Matroids and Biased Graphs

Thomas Zaslavsky, 1994, Eur. J. Comb..

Advanced Problems: 6661-6663

Jeffrey C. Lagarias, Thomas Zaslavsky, Walther Janous, 1991 .

Supersolvable Frame-matroid and Graphic-lift Lattices

Thomas Zaslavsky, T. Zaslavsky, 2001, Eur. J. Comb..

The biased graphs whose matroids are binary

Thomas Zaslavsky, T. Zaslavsky, 1987, J. Comb. Theory B.

Biased graphs. VII. Contrabalance and antivoltages

Thomas Zaslavsky, T. Zaslavsky, 2007, J. Comb. Theory, Ser. B.

The Largest Parity Demigenus of a Simple Graph

Thomas Zaslavsky, 1997, J. Comb. Theory, Ser. B.

The Order Upper Bound on Parity Embedding of a Graph

Thomas Zaslavsky, T. Zaslavsky, 1996, J. Comb. Theory, Ser. B.

Magic Squares and Nontransitive Dice: 11099

John H. Lindsey, Thomas Zaslavsky, Matthias Beck, 2006, Am. Math. Mon..

Orientation of Signed Graphs

Thomas Zaslavsky, 1991, Eur. J. Comb..

Problem 11099

Thomas Zaslavsky, Matthias Beck, Richard Ehrenborg, 2004, Am. Math. Mon..

Signed analogs of bipartite graphs

Thomas Zaslavsky, 1998, Discret. Math..

Correction to "Complementary Matching Vectors and the Uniform Matching Extension Property"

Thomas Zaslavsky, 1981, Eur. J. Comb..

Negative Circles in Signed Graphs: A Problem Collection

Thomas Zaslavsky, 2017, Electron. Notes Discret. Math..

The Signed Chromatic Number of the Projective Plane and Klein Bottle and Antipodal Graph Coloring

Thomas Zaslavsky, 1995, J. Comb. Theory, Ser. B.

Characterization of Line-Consistent Signed Graphs

Thomas Zaslavsky, Daniel C. Slilaty, 2015, Discuss. Math. Graph Theory.

A Coding Approach to Signed Graphs

Thomas Zaslavsky, Patrick Solé, 1994, SIAM J. Discret. Math..

Signed graph coloring

Thomas Zaslavsky, T. Zaslavsky, 1982, Discret. Math..

Lattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphs

Thomas Zaslavsky, David Forge, T. Zaslavsky, 2013, J. Comb. Theory, Ser. B.

Biased graphs. VI. synthetic geometry

Thomas Zaslavsky, Rigoberto Flórez, 2019, Eur. J. Comb..

Which Exterior Powers are Balanced?

Thomas Zaslavsky, Devlin Mallory, Abigail Raz, 2013, Electron. J. Comb..

Signed graphs

Thomas Zaslavsky, 1982, Discret. Appl. Math..

A q-Queens Problem. I. General Theory

Thomas Zaslavsky, Seth Chaiken, Christopher R. H. Hanusa, 2014, Electron. J. Comb..

Chromatic invariants of signed graphs

Thomas Zaslavsky, T. Zaslavsky, 1982, Discret. Math..

An Elementary Chromatic Reduction for Gain Graphs and Special Hyperplane Arrangements

Thomas Zaslavsky, David Forge, Raul Cordovil, 2009, Electron. J. Comb..

Characterizations of signed graphs

Thomas Zaslavsky, T. Zaslavsky, 1981, J. Graph Theory.

The number of nowhere-zero flows on graphs and signed graphs

Thomas Zaslavsky, Matthias Beck, T. Zaslavsky, 2003, J. Comb. Theory, Ser. B.

The dimension of the negative cycle vectors of a signed graph

Alex Schaefer, Thomas Zaslavsky, 2019, Ars Math. Contemp..

The projective-planar signed graphs

Thomas Zaslavsky, T. Zaslavsky, 1993, Discret. Math..

Biased graphs. I. Bias, balance, and gains

Thomas Zaslavsky, T. Zaslavsky, 1989, J. Comb. Theory, Ser. B.

Mock threshold graphs

Thomas Zaslavsky, Vaidy Sivaraman, Richard Behr, 2016, Discret. Math..

Preface

Xuding Zhu, Sandi Klavzar, Thomas Zaslavsky, 2012, Discret. Math..

Biased graphs IV: Geometrical realizations

Thomas Zaslavsky, T. Zaslavsky, 2003, J. Comb. Theory, Ser. B.

Perpendicular Dissections of Space

Thomas Zaslavsky, T. Zaslavsky, 2010, Discret. Comput. Geom..

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

Thomas Zaslavsky, 1983, Discret. Appl. Math..

Balanced decompositions of a signed graph

Thomas Zaslavsky, T. Zaslavsky, 1987, J. Comb. Theory, Ser. B.

Maximal Dissections of a Simplex

Thomas Zaslavsky, 1976, J. Comb. Theory, Ser. A.

Forbidden Induced Subgraphs

Thomas Zaslavsky, T. Zaslavsky, 2016, Electron. Notes Discret. Math..

Negative (and positive) circles in signed graphs: A problem collection

Thomas Zaslavsky, T. Zaslavsky, 2017, AKCE Int. J. Graphs Comb..

On the division of space by topological hyperplanes

Thomas Zaslavsky, David Forge, 2009, Eur. J. Comb..

Two Hamiltonian cycles

Thomas Zaslavsky, Vaidy Sivaraman, 2022, Discrete Mathematics.

The characteristic polynomial of a graph containing loops

Thomas Zaslavsky, Deepa Sinha, Bableen Kaur, 2021, Discret. Appl. Math..

Homomorphisms of signed graphs: An update

Thomas Zaslavsky, Reza Naserasr, Eric Sopena, 2021, Eur. J. Comb..

Characterizations of some parity signed graphs

Thomas Zaslavsky, Joseph Varghese Kureethara, Mukti Acharya, 2021, Australas. J Comb..

Criteria for Balance in Abelian Gain Graphs ∗

Thomas Zaslavsky, Konstantin Rybnikov, T. Zaslavsky, 2002 .

BICIRCULAR GEOMETRY AND THE LATTICE OF FORESTS OF A GRAPH

Thomas Zaslavsky, T. Zaslavsky, 1982 .

Biased Graphs. V. Group and Biased Expansions

Thomas Zaslavsky, 2002 .

Avoiding the Identity: 10606

Thomas Zaslavsky, Stephen M. Gagola, T. Zaslavsky, 1999 .

Signed Graphs and Geometry

Thomas Zaslavsky, 2013 .

ON THE INTERPRETATION OF WHITNEY NUMBERS THROUGH ARRANGEMENTS OF HYPERPLANES, ZONOTOPES, NON-RADON PARTITIONS, AND ORIENTATIONS OF GRAPHS

Thomas Zaslavsky, Curtis Greene, T. Zaslavsky, 1983 .

A simple algorithm that proves half-integrality of bidirected network programming

Thomas Zaslavsky, Ethan D. Bolker, 2006 .

GEOMETRIC LATTICES OF STRUCTURED PARTITIONS I. Gain-graphic matroids and group valued partitions*

Thomas Zaslavsky, T. Zaslavsky, 1992 .

Frustration vs . Clusterability in Two-Mode Signed Networks ( Signed Bipartite Graphs )

Thomas Zaslavsky, T. Zaslavsky, 2010 .

Interference in Graphs

Thomas Zaslavsky, Viji Paul, B. D. Acharya, 2014 .

Inside-out polytopes

Thomas Zaslavsky, Matthias Beck, T. Zaslavsky, 2003, math/0309330.

Six Little Squares and How Their Numbers Grow

Thomas Zaslavsky, Matthias Beck, 2010 .

Colorations , Orthotopes , and a Huge Polynomial Tutte Invariant of Weighted Gain Graphs Version of May 12 , 2007 David Forge

Thomas Zaslavsky, T. Zaslavsky, 2007 .

Voltage-Graphic Matroids

Thomas Zaslavsky, 2010 .

Combinatorial Geometries: The Möbius Function and the Characteristic Polynomial

Thomas Zaslavsky, T. Zaslavsky, 1987 .

Strong Tutte functions of matroids and graphs

Thomas Zaslavsky, T. Zaslavsky, 1992 .

Glossary of Signed and Gain Graphs

Thomas Zaslavsky, 2002 .

On products and line graphs of signed graphs, their eigenvalues and energy

Thomas Zaslavsky, K ShahulHameed, K. A. Germina, 2010 .

Glossary of signed and gain graphs and allied areas.

Thomas Zaslavsky, 1998 .

The Geometry of Root Systems and Signed Graphs

Thomas Zaslavsky, T. Zaslavsky, 1981 .

A short generalization of the Meshalkin-Hochberg-Hirsch bounds on componentwise antichains

Thomas Zaslavsky, Matthias Beck, T. Zaslavsky, 2001 .

RESEARCH AREAS

Thomas Zaslavsky, Ross Geoghegan, Marcin Mazur, 2013 .

Polynomial Tutte Invariants of Rooted Integral Gain Graphs

Thomas Zaslavsky, David Forge, 2005 .

Matrices in the Theory of Signed Simple Graphs

Thomas Zaslavsky, T. Zaslavsky, 2013, 1303.3083.

Counting the faces of cut-up spaces

Thomas Zaslavsky, T. Zaslavsky, 1975 .

Vertices of localized imbalance in a biased graph

Thomas Zaslavsky, 1987 .