| Two Hamiltonian cycles | 0 | 0.34 | 2022 |
| Characterizations Of Some Parity Signed Graphs | 0 | 0.34 | 2021 |
| The Characteristic Polynomial Of A Graph Containing Loops | 0 | 0.34 | 2021 |
| A q-queens problem. VII. Combinatorial types of nonattacking chess riders | 0 | 0.34 | 2020 |
| Projective planarity of matroids of 3-nets and biased graphs | 0 | 0.34 | 2020 |
| Biased graphs. VI. synthetic geometry | 0 | 0.34 | 2019 |
| A -queens problem. VI. The bishops' period. | 0 | 0.34 | 2019 |
| Mock threshold graphs. | 1 | 0.36 | 2018 |
| Negative Circles in Signed Graphs: A Problem Collection. | 0 | 0.34 | 2017 |
| Forbidden Induced Subgraphs. | 0 | 0.34 | 2017 |
| Resolution of indecomposable integral flows on signed graphs. | 0 | 0.34 | 2017 |
| Lattice Points in Orthotopes and a Huge Polynomial Tutte Invariant of Weighted Gain Graphs | 0 | 0.34 | 2016 |
| The Dynamics of the Forest Graph Operator | 0 | 0.34 | 2016 |
| Characterization of Line-Consistent Signed Graphs | 0 | 0.34 | 2015 |
| A q-Queens Problem. I. General Theory. | 1 | 0.40 | 2014 |
| Which Exterior Powers are Balanced? | 1 | 0.40 | 2013 |
| Six signed Petersen graphs, and their automorphisms | 0 | 0.34 | 2012 |
| An elementary chromatic reduction for gain graphs and special hyperplane arrangements | 2 | 0.47 | 2009 |
| Totally frustrated states in the chromatic theory of gain graphs | 2 | 0.49 | 2009 |
| On the division of space by topological hyperplanes | 0 | 0.34 | 2009 |
| Biased graphs. VII. Contrabalance and antivoltages | 0 | 0.34 | 2007 |
| Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements | 3 | 0.50 | 2007 |
| The number of nowhere-zero flows on graphs and signed graphs | 10 | 1.24 | 2006 |
| A simple algorithm that proves half-integrality of bidirected network programming | 7 | 0.58 | 2006 |
| Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups | 1 | 0.40 | 2006 |
| Criteria for Balance in Abelian Gain Graphs, with Applications to Piecewise-Linear Geometry | 5 | 0.60 | 2005 |
| Periodicity in quasipolynomial convolution | 1 | 0.48 | 2004 |
| A Meshalkin theorem for projective geometries | 1 | 2.40 | 2003 |
| Biased graphs IV: geometrical realizations | 8 | 1.36 | 2003 |
| A shorter, simpler, stronger proof of the Meshalkin-Hochberg-Hirsch bounds on componentwise antichains | 3 | 2.43 | 2002 |
| Perpendicular Dissections of Space | 4 | 0.62 | 2002 |
| The largest demigenus of a bipartie signed graph | 2 | 0.41 | 2001 |
| Supersolvable frame-matroid and graphic-lift lattices | 4 | 0.87 | 2001 |
| Signed analogs of bipartite graphs | 1 | 0.46 | 1998 |
| Is There A Matroid Theory Of Signed Graph Embedding? | 2 | 0.53 | 1997 |
| The largest parity demigenus of a simple graph | 2 | 0.41 | 1997 |
| The order upper bound on parity embedding of a graph | 4 | 0.75 | 1996 |
| The signed chromatic number of the projective plane and Klein bottle and antipodal graph coloring | 0 | 0.34 | 1995 |
| Biased graphs. III. Chromatic and dichromatic invariants | 8 | 0.72 | 1995 |
| Frame matroids and biased graphs | 12 | 1.05 | 1994 |
| Maximality of the cycle code of a graph | 4 | 0.54 | 1994 |
| The projective-planar signed graphs | 7 | 0.97 | 1993 |
| The covering radius of the cycle code of a graph | 6 | 1.12 | 1993 |
| Orientation embedding of signed graphs | 8 | 1.04 | 1992 |
| Orientation of signed graphs | 27 | 2.23 | 1991 |
| Biased graphs. II.: The three matroids | 43 | 2.87 | 1991 |
| Biased Graphs Whose Matroids Are Special Binary Matroids | 11 | 1.37 | 1990 |
| Biased graphs. I. Bias, balance, and gains | 54 | 5.28 | 1989 |
| Balanced decompositions of a signed graph | 6 | 0.43 | 1987 |
| The biased graphs whose matroids are binary | 7 | 1.86 | 1987 |
