Alexander K. Kelmans

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