Comparison of graphs by their number of spanning trees. - Alexander K. Kelmans (Discret. Math., 1976)

Nonisomorphic Trees with the Same T-Polynomial. - E. A. Dinic; Alexander K. Kelmans; M. A. Zaitsev (Inf. Process. Lett., 1977)

Concept of a vertex in a matroid and 3-connected graphs. - Alexander K. Kelmans (J. Graph Theory, 1980)

Graphs with an extremal number of spanning trees. - Alexander K. Kelmans (J. Graph Theory, 1980)

A new planarity criterion for 3-connected graphs. - Alexander K. Kelmans (J. Graph Theory, 1981)

On 3-skein isomorphisms of graphs. - Robert L. Hemminger; Heinz Adolf Jung; Alexander K. Kelmans (Comb., 1982)

When m vertices in a k-connected graph cannot be walked round along a simple cycle. - Alexander K. Kelmans; M. V. Lomonosov (Discret. Math., 1982)

A cubic 3-connected graph having no cycle through given 10 vertices has the "Petersen form". - Alexander K. Kelmans; M. V. Lomonosov (J. Graph Theory, 1982)

Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications. - Alexander K. Kelmans; Boris N. Kimelfeld (Discret. Math., 1983)

On cycles through prescribed vertices in weakly separable graphs. - Alexander K. Kelmans; M. V. Lomonosov (Discret. Math., 1983)

A strengthening of the Kuratowski planarity criterion for 3-connected graphs. - Alexander K. Kelmans (Discret. Math., 1984)

A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs. - Alexander K. Kelmans (Discret. Math., 1987)

Graph planarity and related topics. - Alexander K. Kelmans (Graph Structure Theory, 1991)

Spanning trees of extended graphs. - Alexander K. Kelmans (Comb., 1992)

On Universal Threshold Graphs. - Peter L. Hammer; Alexander K. Kelmans (Comb. Probab. Comput., 1994)

On Edge Semi-Isomorphisms and Semi-Dualities of Graphs. - Alexander K. Kelmans (Graphs Comb., 1994)

Laplacian Spectra and Spanning Trees of Threshold Graphs. - Peter L. Hammer; Alexander K. Kelmans (Discret. Appl. Math., 1996)

On graphs with the maximum number of spanning trees. - Alexander K. Kelmans (Random Struct. Algorithms, 1996)

Optimal packing of induced stars in a graph. - Alexander K. Kelmans (Discret. Math., 1997)

Transformations of a Graph Increasing its Laplacian Polynomial and Number of Spanning Trees. - Alexander K. Kelmans (Eur. J. Comb., 1997)

Star partitions of graphs. - Yoshimi Egawa; Mikio Kano; Alexander K. Kelmans (J. Graph Theory, 1997)

On the distribution of eigenvalues of graphs. - Alexander K. Kelmans; Xuerong Yong (Discret. Math., 1999)

Crossing properties of graph reliability functions. - Alexander K. Kelmans (J. Graph Theory, 2000)

On convex embeddings of planar 3-connected graphs. - Alexander K. Kelmans (J. Graph Theory, 2000)

Asymptotically Optimal Tree-Packings in Regular Graphs. - Alexander K. Kelmans; Dhruv Mubayi; Benny Sudakov (Electron. J. Comb., 2001)

On graph planarity and semi-duality. - Alexander K. Kelmans (Discret. Math., 2001)

On Homotopy of connected graphs having the same degree function. - Alexander K. Kelmans (Discret. Math., 2001)

On packing 3-vertex paths in a graph. - Atsushi Kaneko; Alexander K. Kelmans; Tsuyoshi Nishimura (J. Graph Theory, 2001)

On the Laplacian Spectrum of (alpha, omega) -Graphs. - Alexander K. Kelmans (Eur. J. Comb., 2002)

On graph closures. - Alexander K. Kelmans (Discret. Math., 2003)

How many disjoint 2-edge paths must a cubic graph have? - Alexander K. Kelmans; Dhruv Mubayi (J. Graph Theory, 2004)

On Hamiltonicity of {claw, net}-free graphs. - Alexander K. Kelmans (Discret. Math., 2006)

Packing k-edge trees in graphs of restricted vertex degrees. - Alexander K. Kelmans (J. Graph Theory, 2007)

Generalizations of Abel's and Hurwitz's identities. - Alexander K. Kelmans; Alexander Postnikov (Eur. J. Comb., 2008)

Operations on Graphs Increasing Some Graph Parameters - Alexander K. Kelmans (CoRR, 2011)

Packing 3-vertex paths in claw-free graphs and related topics. - Alexander K. Kelmans (Discret. Appl. Math., 2011)

On Convex Polytopes in the d-dimensional Space Containing and Avoiding Zero - Alexander K. Kelmans; Anatoliy Rubinov (CoRR, 2012)

Laplacian spectra of regular graph transformations. - Aiping Deng; Alexander K. Kelmans; Juan Meng (Discret. Appl. Math., 2013)

On convex polytopes in Rd containing and avoiding zero. - Alexander K. Kelmans; Anatoliy Rubinov (Eur. J. Comb., 2013)

Adjacency polynomials of digraph transformations. - Aiping Deng; Mengyu Feng; Alexander K. Kelmans (Discret. Appl. Math., 2016)

On graphs uniquely defined by their K-circular matroids. - José F. De Jesús; Alexander K. Kelmans (Discret. Appl. Math., 2017)

k-circular matroids of graphs. - José F. De Jesús; Alexander K. Kelmans (Discret. Appl. Math., 2017)

Graphs with the same truncated cycle matroid. - José F. De Jesús; Alexander K. Kelmans (CoRR, 2022)