Alexander K. Kelmans

发表

On 3-skein isomorphisms of graphs

Robert L. Hemminger, Heinz Adolf Jung, Alexander K. Kelmans, 1982, Comb..

On Homotopy of connected graphs having the same degree function

Alexander K. Kelmans, A. Kelmans, 2001, Discret. Math..

Laplacian spectra of regular graph transformations

Alexander K. Kelmans, Juan Meng, Aiping Deng, 2017, Discret. Appl. Math..

On graphs uniquely defined by their K-circular matroids

Alexander K. Kelmans, José F. De Jesús, 2017, Discret. Appl. Math..

When m vertices in a k-connected graph cannot be walked round along a simple cycle

Alexander K. Kelmans, M. V. Lomonosov, A. Kelmans, 1982, Discret. Math..

On Universal Threshold Graphs

Alexander K. Kelmans, Peter L. Hammer, P. Hammer, 1994, Combinatorics, Probability and Computing.

Comparison of graphs by their number of spanning trees

Alexander K. Kelmans, 1976, Discret. Math..

Optimal packing of induced stars in a graph

Alexander K. Kelmans, 1997, Discret. Math..

Transformations of a Graph Increasing its Laplacian Polynomial and Number of Spanning Trees

Alexander K. Kelmans, 1997, Eur. J. Comb..

K-circular Matroids of Graphs

Alexander K. Kelmans, José F. De Jesús, A. Kelmans, 2015, Discret. Appl. Math..

Asymptotically Optimal Tree-Packings in Regular Graphs

Alexander K. Kelmans, Benny Sudakov, Dhruv Mubayi, 2001, Electron. J. Comb..

Generalizations of Abel's and Hurwitz's identities

Alexander K. Kelmans, Alexander Postnikov, 2008, Eur. J. Comb..

Concept of a vertex in a matroid and 3-connected graphs

Alexander K. Kelmans, 1980, J. Graph Theory.

Operations on Graphs Increasing Some Graph Parameters pdf

Alexander K. Kelmans, A. Kelmans, 2011, ArXiv.

A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs

Alexander K. Kelmans, 1987, Discret. Math..

Nonisomorphic Trees with the Same T-Polynomial

Alexander K. Kelmans, E. A. Dinic, M. A. Zaitsev, 1977, Inf. Process. Lett..

On the Laplacian Spectrum of (alpha, omega) -Graphs

Alexander K. Kelmans, 2002, Eur. J. Comb..

On graphs with the maximum number of spanning trees

Alexander K. Kelmans, 1996, Random Struct. Algorithms.

On convex embeddings of planar 3-connected graphs

Alexander K. Kelmans, 2000, J. Graph Theory.

Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications

Alexander K. Kelmans, B. N. Kimelfeld, 1983, Discret. Math..

How many disjoint 2-edge paths must a cubic graph have?

Alexander K. Kelmans, Dhruv Mubayi, 2004, J. Graph Theory.

Crossing properties of graph reliability functions

Alexander K. Kelmans, 2000, J. Graph Theory.

Graph planarity and related topics

Alexander K. Kelmans, A. Kelmans, 1991, Graph Structure Theory.

On Convex Polytopes in the d-dimensional Space Containing and Avoiding Zero pdf

Alexander K. Kelmans, Anatoliy Rubinov, 2012, ArXiv.

Packing 3-vertex paths in claw-free graphs and related topics

Alexander K. Kelmans, A. Kelmans, 2007, Discret. Appl. Math..

Spanning trees of extended graphs

Alexander K. Kelmans, 1992, Comb..

A strengthening of the Kuratowski planarity criterion for 3-connected graphs

Alexander K. Kelmans, A. Kelmans, 1984, Discret. Math..

On convex polytopes in Rd containing and avoiding zero

Alexander K. Kelmans, Anatoliy Rubinov, 2013, Eur. J. Comb..

Laplacian Spectra and Spanning Trees of Threshold Graphs

Alexander K. Kelmans, Peter L. Hammer, P. Hammer, 1996, Discret. Appl. Math..

On packing 3-vertex paths in a graph

Alexander K. Kelmans, Atsushi Kaneko, Tsuyoshi Nishimura, 2001, J. Graph Theory.

A new planarity criterion for 3-connected graphs

Alexander K. Kelmans, 1981, J. Graph Theory.

On graph closures

Alexander K. Kelmans, 2003, Discret. Math..

On graph planarity and semi-duality

Alexander K. Kelmans, 2001, Discret. Math..

On the distribution of eigenvalues of graphs

Alexander K. Kelmans, Xuerong Yong, 1999, Discret. Math..

Packing k-edge trees in graphs of restricted vertex degrees

Alexander K. Kelmans, 2007, J. Graph Theory.

On Edge Semi-Isomorphisms and Semi-Dualities of Graphs

Alexander K. Kelmans, 1994, Graphs Comb..

Adjacency polynomials of digraph transformations

Alexander K. Kelmans, Aiping Deng, Mengyu Feng, 2016, Discret. Appl. Math..

Graphs with an extremal number of spanning trees

Alexander K. Kelmans, 1980, J. Graph Theory.

On Hamiltonicity of {claw, net}-free graphs

Alexander K. Kelmans, 2006, Discret. Math..

Star partitions of graphs

Alexander K. Kelmans, Yoshimi Egawa, Mikio Kano, 1997, J. Graph Theory.