- Homomorphisms of signed graphs: An updateejc, 91:103222, 2021. [doi]

- A q-Queens Problem IV. Attacking configurations and their denominatorsDM, 343(2):111649, 2020. [doi]
- Projective planarity of matroids of 3-nets and biased graphsajc, 76:299-338, 2020. [doi]
- A q-queens problem VII: Combinatorial types of nonattacking chess ridersajc, 77:326-335, 2020. [doi]

- q-queens problem III. Nonattacking partial queensajc, 74:305-331, 2019. [doi]
- q-queens problem. VI. The bishops' periodarsmc, 16(2):549-561, 2019. [doi]
- Biased graphs. VI. synthetic geometryejc, 81:119-141, 2019. [doi]
- The dimension of the negative cycle vectors of a signed grapharsmc, 16(2):625-639, 2019. [doi]

- Mock threshold graphsDM, 341(8):2159-2178, 2018. [doi]
- Negative (and positive) circles in signed graphs: A problem collectionakcej, 15(1):31-48, 2018. [doi]

- Resolution of indecomposable integral flows on signed graphsDM, 340(6):1271-1286, 2017. [doi]
- Negative Circles in Signed Graphs: A Problem Collectionendm, 63:41-47, 2017. [doi]
- Forbidden Induced Subgraphsendm, 63:3-10, 2017. [doi]

- The dynamic of the forest graph operatordmgt, 36(4):899-913, 2016. [doi]

- Characterization of line-consistent signed graphsdmgt, 35(3):589-594, 2015. [doi]

- A q-Queens Problem. I. General Theorycombinatorics, 21(3), 2014. [doi]

- Which Exterior Powers are Balanced?combinatorics, 20(2), 2013. [doi]

- Six signed Petersen graphs, and their automorphismsDM, 312(9):1558-1583, 2012. [doi]

- An Elementary Chromatic Reduction for Gain Graphs and Special Hyperplane Arrangementscombinatorics, 16(1), 2009. [doi]
- On the division of space by topological hyperplanesejc, 30(8):1835-1845, 2009. [doi]
- Totally frustrated states in the chromatic theory of gain graphsejc, 30(1):133-156, 2009. [doi]

- Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangementsJCT, 114(1):97-109, 2007. [doi]
- Biased graphs. VII. Contrabalance and antivoltagesJCT, 97(6):1019-1040, 2007. [doi]

- The number of nowhere-zero flows on graphs and signed graphsJCT, 96(6):901-918, 2006. [doi]
- Magic Squares and Nontransitive Dice: 11099tamm, 113(5):464-465, 2006. [doi]

- Problem 11099tamm, 111(7):625-626, 2004. [doi]
- Periodicity in Quasipolynomial Convolutioncombinatorics, 11(2), 2004. [doi]

- A Meshalkin theorem for projective geometriesJCT, 102(2):433-441, 2003. [doi]
- Biased graphs IV: Geometrical realizationsJCT, 89(2):231-297, 2003. [doi]

- A Shorter, Simpler, Stronger Proof of the Meshalkin-Hochberg-Hirsch Bounds on Componentwise AntichainsJCT, 100(1):196-199, 2002. [doi]
- Perpendicular Dissections of Spacedcg, 27(3):303-351, 2002. [doi]

- The largest demigenus of a bipartite signed graphDM, 232(1-3):189-193, 2001. [doi]
- Supersolvable Frame-matroid and Graphic-lift Latticesejc, 22(1):119-133, 2001. [doi]

- Signed analogs of bipartite graphsDM, 179(1-3):205-216, 1998. [doi]

- The Largest Parity Demigenus of a Simple GraphJCT, 70(2):325-345, 1997. [doi]

- The Order Upper Bound on Parity Embedding of a GraphJCT, 68(1):149-160, 1996. [doi]

- The Signed Chromatic Number of the Projective Plane and Klein Bottle and Antipodal Graph ColoringJCT, 63(1):136-145, 1995. [doi]
- Biased Graphs .III. Chromatic and Dichromatic InvariantsJCT, 64(1):17-88, 1995. [doi]

- A Coding Approach to Signed Graphssiamdm, 7(4):544-553, 1994. [doi]
- Maximality of the cycle code of a graphDM, 128(1-3):401-405, 1994. [doi]
- Frame Matroids and Biased Graphsejc, 15(3):303-307, 1994. [doi]

- The Covering Radius of the Cycle Code of a GraphDAM, 45(1):63-70, 1993. [doi]
- The projective-planar signed graphsDM, 113(1-3):223-247, 1993. [doi]

- Orientation embedding of signed graphsjgt, 16(5):399-422, 1992. [doi]

- Biased graphs. II. The three matroidsJCT, 51(1):46-72, 1991. [doi]
- Orientation of Signed Graphsejc, 12(4):361-375, 1991. [doi]

- Biased graphs whose matroids are special binary matroidsgc, 6(1):77-93, 1990. [doi]

- Biased graphs. I. Bias, balance, and gainsJCT, 47(1):32-52, 1989. [doi]

- Balanced decompositions of a signed graphJCT, 43(1):1-13, 1987. [doi]
- The biased graphs whose matroids are binaryJCT, 42(3):337-347, 1987. [doi]

- How colorful the signed graph?DM, 52(2-3):279-284, 1984. [doi]

- Chromatic invariants of signed graphsDM, 42(2-3):287-312, 1982. [doi]
- Signed graph coloringDM, 39(2):215-228, 1982. [doi]
- Signed graphsDAM, 4(1):47-74, 1982. [doi]

- Characterizations of signed graphsjgt, 5(4):401-406, 1981. [doi]
- Correction to "Complementary Matching Vectors and the Uniform Matching Extension Property"ejc, 2(3):305, 1981. [doi]
- Complementary Matching Vectors and the Uniform Matching Extension Propertyejc, 2(1):91-103, 1981. [doi]

- Maximal Dissections of a SimplexJCT, 20(2):244-257, 1976.