| 2008 |
|---|
| 24 | EE | Alexander K. Kelmans,
Alexander Postnikov:
Generalizations of Abel's and Hurwitz's identities.
Eur. J. Comb. 29(7): 1535-1543 (2008) |
| 2007 |
|---|
| 23 | EE | Alexander K. Kelmans:
Packing k-edge trees in graphs of restricted vertex degrees.
Journal of Graph Theory 55(4): 306-324 (2007) |
| 2006 |
|---|
| 22 | EE | Alexander K. Kelmans:
On Hamiltonicity of {claw, net}-free graphs.
Discrete Mathematics 306(21): 2755-2761 (2006) |
| 2004 |
|---|
| 21 | EE | Alexander K. Kelmans,
Dhruv Mubayi:
How many disjoint 2-edge paths must a cubic graph have?
Journal of Graph Theory 45(1): 57-79 (2004) |
| 2003 |
|---|
| 20 | EE | Alexander K. Kelmans:
On graph closures.
Discrete Mathematics 271(1-3): 141-168 (2003) |
| 2002 |
|---|
| 19 | EE | Alexander K. Kelmans:
On the Laplacian Spectrum of (alpha, omega) -Graphs.
Eur. J. Comb. 23(6): 673-682 (2002) |
| 2001 |
|---|
| 18 | EE | Alexander K. Kelmans:
On graph planarity and semi-duality.
Discrete Mathematics 230(1-3): 149-166 (2001) |
| 17 | EE | Alexander K. Kelmans:
On Homotopy of connected graphs having the same degree function.
Discrete Mathematics 230(1-3): 167-187 (2001) |
| 16 | EE | Alexander K. Kelmans,
Dhruv Mubayi,
Benny Sudakov:
Asymptotically Optimal Tree-Packings in Regular Graphs.
Electr. J. Comb. 8(1): (2001) |
| 1999 |
|---|
| 15 | EE | Alexander K. Kelmans,
Xuerong Yong:
On the distribution of eigenvalues of graphs.
Discrete Mathematics 199(1-3): 251-258 (1999) |
| 1997 |
|---|
| 14 | EE | Alexander K. Kelmans:
Optimal packing of induced stars in a graph.
Discrete Mathematics 173(1-3): 97-127 (1997) |
| 13 | EE | Alexander K. Kelmans:
Transformations of a Graph Increasing its Laplacian Polynomial and Number of Spanning Trees.
Eur. J. Comb. 18(1): 35-48 (1997) |
| 1996 |
|---|
| 12 | EE | Peter L. Hammer,
Alexander K. Kelmans:
Laplacian Spectra and Spanning Trees of Threshold Graphs.
Discrete Applied Mathematics 65(1-3): 255-273 (1996) |
| 11 | | Alexander K. Kelmans:
On graphs with the maximum number of spanning trees.
Random Struct. Algorithms 9(1-2): 177-192 (1996) |
| 1994 |
|---|
| 10 | | Peter L. Hammer,
Alexander K. Kelmans:
On Universal Threshold Graphs.
Combinatorics, Probability & Computing 3: 327-344 (1994) |
| 1992 |
|---|
| 9 | | Alexander K. Kelmans:
Spanning trees of extended graphs.
Combinatorica 12(1): 45-51 (1992) |
| 1991 |
|---|
| 8 | | Alexander K. Kelmans:
Graph planarity and related topics.
Graph Structure Theory 1991: 635-668 |
| 1987 |
|---|
| 7 | EE | Alexander K. Kelmans:
A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs.
Discrete Mathematics 64(1): 13-25 (1987) |
| 1984 |
|---|
| 6 | EE | Alexander K. Kelmans:
A strengthening of the Kuratowski planarity criterion for 3-connected graphs.
Discrete Mathematics 51(3): 215-220 (1984) |
| 1983 |
|---|
| 5 | EE | Alexander K. Kelmans,
B. N. Kimelfeld:
Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications.
Discrete Mathematics 44(1): 113-116 (1983) |
| 4 | EE | Alexander K. Kelmans,
M. V. Lomonosov:
On cycles through prescribed vertices in weakly separable graphs.
Discrete Mathematics 46(2): 183-189 (1983) |
| 1982 |
|---|
| 3 | | Robert L. Hemminger,
Heinz Adolf Jung,
Alexander K. Kelmans:
On 3-skein isomorphisms of graphs.
Combinatorica 2(4): 373-376 (1982) |
| 2 | EE | Alexander K. Kelmans,
M. V. Lomonosov:
When m vertices in a k-connected graph cannot be walked round along a simple cycle.
Discrete Mathematics 38(2-3): 317-322 (1982) |
| 1977 |
|---|
| 1 | | E. A. Dinic,
Alexander K. Kelmans,
M. A. Zaitsev:
Nonisomorphic Trees with the Same T-Polynomial.
Inf. Process. Lett. 6(3): 73-76 (1977) |
