Alexander K. Kelmans

Publication Activity (10 Years)

Years Active: 1976-2022
Publications (10 Years): 4

Top Topics

Preserving Transformations

Convexity Properties

Laplacian Matrix

Independent Set

Top Venues

Discret. Appl. Math.

Publications

José F. De Jesus, Alexander K. Kelmans
Graphs with the same truncated cycle matroid. CoRR (2022)
José F. De Jesús, Alexander K. Kelmans
k-circular matroids of graphs. Discret. Appl. Math. 225 (2017)
José F. De Jesús, Alexander K. Kelmans
On graphs uniquely defined by their K-circular matroids. Discret. Appl. Math. 217 (2017)
Aiping Deng, Mengyu Feng, Alexander K. Kelmans
Adjacency polynomials of digraph transformations. Discret. Appl. Math. 206 (2016)
Alexander K. Kelmans, Anatoliy Rubinov
On convex polytopes in Rd containing and avoiding zero. Eur. J. Comb. 34 (4) (2013)
Aiping Deng, Alexander K. Kelmans, Juan Meng
Laplacian spectra of regular graph transformations. Discret. Appl. Math. 161 (1-2) (2013)
Alexander K. Kelmans, Anatoliy Rubinov
On Convex Polytopes in the d-dimensional Space Containing and Avoiding Zero CoRR (2012)
Alexander K. Kelmans
Packing 3-vertex paths in claw-free graphs and related topics. Discret. Appl. Math. 159 (2-3) (2011)
Alexander K. Kelmans
Operations on Graphs Increasing Some Graph Parameters CoRR (2011)
Alexander K. Kelmans
Packing 3-vertex paths in claw-free graphs and related topics. CoRR (2009)
Alexander K. Kelmans, Alexander Postnikov
Generalizations of Abel's and Hurwitz's identities. Eur. J. Comb. 29 (7) (2008)
Alexander K. Kelmans
-edge trees in graphs of restricted vertex degrees. J. Graph Theory 55 (4) (2007)
Alexander K. Kelmans
On Hamiltonicity of {claw, net}-free graphs. Discret. Math. 306 (21) (2006)
Alexander K. Kelmans, Dhruv Mubayi
How many disjoint 2-edge paths must a cubic graph have? J. Graph Theory 45 (1) (2004)
Alexander K. Kelmans
On graph closures. Discret. Math. 271 (1-3) (2003)
Alexander K. Kelmans
On the Laplacian Spectrum of (alpha, omega) -Graphs. Eur. J. Comb. 23 (6) (2002)
Alexander K. Kelmans
On Homotopy of connected graphs having the same degree function. Discret. Math. 230 (1-3) (2001)
Alexander K. Kelmans, Dhruv Mubayi, Benny Sudakov
Asymptotically Optimal Tree-Packings in Regular Graphs. Electron. J. Comb. 8 (1) (2001)
Alexander K. Kelmans
On graph planarity and semi-duality. Discret. Math. 230 (1-3) (2001)
Atsushi Kaneko, Alexander K. Kelmans, Tsuyoshi Nishimura
On packing 3-vertex paths in a graph. J. Graph Theory 36 (4) (2001)
Alexander K. Kelmans
Crossing properties of graph reliability functions. J. Graph Theory 35 (3) (2000)
Alexander K. Kelmans
On convex embeddings of planar 3-connected graphs. J. Graph Theory 33 (2) (2000)
Alexander K. Kelmans, Xuerong Yong
On the distribution of eigenvalues of graphs. Discret. Math. 199 (1-3) (1999)
Alexander K. Kelmans
Transformations of a Graph Increasing its Laplacian Polynomial and Number of Spanning Trees. Eur. J. Comb. 18 (1) (1997)
Yoshimi Egawa, Mikio Kano, Alexander K. Kelmans
Star partitions of graphs. J. Graph Theory 25 (3) (1997)
Alexander K. Kelmans
Optimal packing of induced stars in a graph. Discret. Math. 173 (1-3) (1997)
Alexander K. Kelmans
On graphs with the maximum number of spanning trees. Random Struct. Algorithms 9 (1-2) (1996)
Peter L. Hammer, Alexander K. Kelmans
Laplacian Spectra and Spanning Trees of Threshold Graphs. Discret. Appl. Math. 65 (1-3) (1996)
Peter L. Hammer, Alexander K. Kelmans
On Universal Threshold Graphs. Comb. Probab. Comput. 3 (1994)
Alexander K. Kelmans
On Edge Semi-Isomorphisms and Semi-Dualities of Graphs. Graphs Comb. 10 (2-4) (1994)
Alexander K. Kelmans
Spanning trees of extended graphs. Comb. 12 (1) (1992)
Alexander K. Kelmans
Graph planarity and related topics. Graph Structure Theory (1991)
Alexander K. Kelmans
A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs. Discret. Math. 64 (1) (1987)
Alexander K. Kelmans
A strengthening of the Kuratowski planarity criterion for 3-connected graphs. Discret. Math. 51 (3) (1984)
Alexander K. Kelmans, M. V. Lomonosov
On cycles through prescribed vertices in weakly separable graphs. Discret. Math. 46 (2) (1983)
Alexander K. Kelmans, Boris N. Kimelfeld
Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications. Discret. Math. 44 (1) (1983)
Alexander K. Kelmans, M. V. Lomonosov
When m vertices in a k-connected graph cannot be walked round along a simple cycle. Discret. Math. 38 (2-3) (1982)
Robert L. Hemminger, Heinz Adolf Jung, Alexander K. Kelmans
On 3-skein isomorphisms of graphs. Comb. 2 (4) (1982)
Alexander K. Kelmans, M. V. Lomonosov
A cubic 3-connected graph having no cycle through given 10 vertices has the "Petersen form". J. Graph Theory 6 (4) (1982)
Alexander K. Kelmans
A new planarity criterion for 3-connected graphs. J. Graph Theory 5 (3) (1981)
Alexander K. Kelmans
Graphs with an extremal number of spanning trees. J. Graph Theory 4 (1) (1980)
Alexander K. Kelmans
Concept of a vertex in a matroid and 3-connected graphs. J. Graph Theory 4 (1) (1980)
E. A. Dinic, Alexander K. Kelmans, M. A. Zaitsev
Nonisomorphic Trees with the Same T-Polynomial. Inf. Process. Lett. 6 (3) (1977)
Alexander K. Kelmans
Comparison of graphs by their number of spanning trees. Discret. Math. 16 (3) (1976)