Thomas Zaslavsky

Discret. Comput. Geom., September, 2024

Cobiased Graphs: Single-Element Extensions and Elementary Quotients of Graphic Matroids.

[BibT_eX]

[DOI]

Daniel C. Slilaty

,

Electron. J. Comb., 2024

Two Hamiltonian cycles.

[BibT_eX]

[DOI]

Vaidy Sivaraman

,

Discret. Math., 2022

Homomorphisms of signed graphs: An update.

[BibT_eX]

[DOI]

Reza Naserasr

,

Éric Sopena

,

Eur. J. Comb., 2021

The characteristic polynomial of a graph containing loops.

[BibT_eX]

[DOI]

Deepa Sinha

,

Bableen Kaur

,

Joseph Varghese Kureethara

Discret. Appl. Math., 2021

Characterizations of some parity signed graphs.

[BibT_eX]

[DOI]

Mukti Acharya

,

,

Australas. J Comb., 2021

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

[BibT_eX]

[DOI]

,

,

Discret. Math., 2020

Strongly connectable digraphs and non-transitive dice.

[BibT_eX]

[DOI]

,

,

,

AKCE Int. J. Graphs Comb., 2020

A q-queens problem VII: Combinatorial types of nonattacking chess riders.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2020

Projective planarity of matroids of 3-nets and biased graphs.

[BibT_eX]

[DOI]

Rigoberto Flórez

,

Australas. J Comb., 2020

Biased graphs. VI. synthetic geometry.

[BibT_eX]

[DOI]

Rigoberto Flórez

,

Eur. J. Comb., 2019

The dimension of the negative cycle vectors of a signed graph.

[BibT_eX]

[DOI]

Alex Schaefer

,

Ars Math. Contemp., 2019

A <i>q</i>-queens problem. VI. The bishops' period.

[BibT_eX]

[DOI]

,

,

Ars Math. Contemp., 2019

A <i>q</i>-queens problem III. Nonattacking partial queens.

[BibT_eX]

[DOI]

,

,

Australas. J Comb., 2019

Mock threshold graphs.

[BibT_eX]

[DOI]

Richard Behr

,

Vaidy Sivaraman

,

Discret. Math., 2018

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

[BibT_eX]

[DOI]

AKCE Int. J. Graphs Comb., 2018

Negative Circles in Signed Graphs: A Problem Collection.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Forbidden Induced Subgraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Preface.

[BibT_eX]

[DOI]

,

,

,

Electron. Notes Discret. Math., 2017

Resolution of indecomposable integral flows on signed graphs.

[BibT_eX]

[DOI]

Beifang Chen

,

Jue Wang

,

Discret. Math., 2017

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

[BibT_eX]

[DOI]

David Forge

,

J. Comb. Theory B, 2016

The dynamic of the forest graph operator.

[BibT_eX]

[DOI]

Suresh Dara

,

Venkateshwarlu Deva

,

Suresh Manjanath Hegde

,

S. B. Rao

,

Discuss. Math. Graph Theory, 2016

Characterization of line-consistent signed graphs.

[BibT_eX]

[DOI]

Daniel C. Slilaty

,

Discuss. Math. Graph Theory, 2015

A q-Queens Problem. I. General Theory.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2014

Which Exterior Powers are Balanced?

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2013

Six signed Petersen graphs, and their automorphisms.

[BibT_eX]

[DOI]

Discret. Math., 2012

Preface.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Math., 2012

Totally frustrated states in the chromatic theory of gain graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

On the division of space by topological hyperplanes.

[BibT_eX]

[DOI]

David Forge

,

Eur. J. Comb., 2009

An Elementary Chromatic Reduction for Gain Graphs and Special Hyperplane Arrangements.

[BibT_eX]

[DOI]

,

,

,

,

Electron. J. Comb., 2009

Biased graphs. VII. Contrabalance and antivoltages.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2007

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

[BibT_eX]

[DOI]

David Forge

,

J. Comb. Theory A, 2007

Magic Squares and Nontransitive Dice: 11099.

[BibT_eX]

[DOI]

,

,

,

,

Am. Math. Mon., 2006

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

[BibT_eX]

[DOI]

Ethan D. Bolker

,

Networks, 2006

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

[BibT_eX]

[DOI]

Konstantin A. Rybnikov

,

J. Graph Theory, 2006

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

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2006

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

[BibT_eX]

[DOI]

Konstantin A. Rybnikov

,

Discret. Comput. Geom., 2005

Problem 11099.

[BibT_eX]

[DOI]

,

Richard Ehrenborg

,

Am. Math. Mon., 2004

Periodicity in Quasipolynomial Convolution.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

Biased graphs IV: Geometrical realizations.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

A Meshalkin theorem for projective geometries.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2003

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

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2002

Perpendicular Dissections of Space.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2002

Supersolvable Frame-matroid and Graphic-lift Lattices.

[BibT_eX]

[DOI]

Eur. J. Comb., 2001

The largest demigenus of a bipartite signed graph.

[BibT_eX]

[DOI]

Discret. Math., 2001

Signed analogs of bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

The Largest Parity Demigenus of a Simple Graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1997

Is There a Matroid Theory of Signed Graph Embedding?

[BibT_eX]

Ars Comb., 1997

The Order Upper Bound on Parity Embedding of a Graph.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1996

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Biased Graphs .III. Chromatic and Dichromatic Invariants.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

A Coding Approach to Signed Graphs.

[BibT_eX]

[DOI]

Patrick Solé

,

SIAM J. Discret. Math., 1994

Frame Matroids and Biased Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1994

Maximality of the cycle code of a graph.

[BibT_eX]

[DOI]

Patrick Solé

,

Discret. Math., 1994

The projective-planar signed graphs.

[BibT_eX]

[DOI]

Discret. Math., 1993

The Covering Radius of the Cycle Code of a Graph.

[BibT_eX]

[DOI]

Patrick Solé

,

Discret. Appl. Math., 1993

Orientation embedding of signed graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1992

Biased graphs. II. The three matroids.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

Orientation of Signed Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1991

Biased graphs whose matroids are special binary matroids.

[BibT_eX]

[DOI]

Graphs Comb., 1990

Biased graphs. I. Bias, balance, and gains.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1989

The biased graphs whose matroids are binary.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1987

Balanced decompositions of a signed graph.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1987

How colorful the signed graph?

[BibT_eX]

[DOI]

Discret. Math., 1984

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 1983

Chromatic invariants of signed graphs.

[BibT_eX]

[DOI]

Discret. Math., 1982

Signed graph coloring.

[BibT_eX]

[DOI]

Discret. Math., 1982

Signed graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1982

Characterizations of signed graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1981

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

[BibT_eX]

[DOI]

Eur. J. Comb., 1981

Complementary Matching Vectors and the Uniform Matching Extension Property.

[BibT_eX]

[DOI]

Eur. J. Comb., 1981

Maximal Dissections of a Simplex.

[BibT_eX]

[DOI]