We stand with Ukraine  

Alexander K. Kelmans

According to our database1, Alexander K. Kelmans authored at least 43 papers between 1976 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Graphs with the same truncated cycle matroid.
[BibTeX]
[DOI]
José F. De Jesús
,
Alexander K. Kelmans
CoRR, 2022

2017
k-circular matroids of graphs.
[BibTeX]
[DOI]
José F. De Jesús
,
Alexander K. Kelmans
Discret. Appl. Math., 2017

On graphs uniquely defined by their K-circular matroids.
[BibTeX]
[DOI]
José F. De Jesús
,
Alexander K. Kelmans
Discret. Appl. Math., 2017

2016
Adjacency polynomials of digraph transformations.
[BibTeX]
[DOI]
Aiping Deng
,
Mengyu Feng
,
Alexander K. Kelmans
Discret. Appl. Math., 2016

2013
On convex polytopes in Rd containing and avoiding zero.
[BibTeX]
[DOI]
Alexander K. Kelmans
,
Anatoliy Rubinov
Eur. J. Comb., 2013

Laplacian spectra of regular graph transformations.
[BibTeX]
[DOI]
Aiping Deng
,
Alexander K. Kelmans
,
Juan Meng
Discret. Appl. Math., 2013

2012
On Convex Polytopes in the d-dimensional Space Containing and Avoiding Zero
[BibTeX]
[DOI]
Alexander K. Kelmans
,
Anatoliy Rubinov
CoRR, 2012

2011
Packing 3-vertex paths in claw-free graphs and related topics.
[BibTeX]
[DOI]
Alexander K. Kelmans
Discret. Appl. Math., 2011

Operations on Graphs Increasing Some Graph Parameters
[BibTeX]
[DOI]
Alexander K. Kelmans
CoRR, 2011

2008
Generalizations of Abel's and Hurwitz's identities.
[BibTeX]
[DOI]
Alexander K. Kelmans
,
Alexander Postnikov
Eur. J. Comb., 2008

2007
Packing <i>k</i>-edge trees in graphs of restricted vertex degrees.
[BibTeX]
[DOI]
Alexander K. Kelmans
J. Graph Theory, 2007

2006
On Hamiltonicity of {claw, net}-free graphs.
[BibTeX]
[DOI]
Alexander K. Kelmans
Discret. Math., 2006

2004
How many disjoint 2-edge paths must a cubic graph have?
[BibTeX]
[DOI]
Alexander K. Kelmans
,
Dhruv Mubayi
J. Graph Theory, 2004

2003
On graph closures.
[BibTeX]
[DOI]
Alexander K. Kelmans
Discret. Math., 2003

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

2001
On packing 3-vertex paths in a graph.
[BibTeX]
[DOI]
Atsushi Kaneko
,
Alexander K. Kelmans
,
Tsuyoshi Nishimura
J. Graph Theory, 2001

On Homotopy of connected graphs having the same degree function.
[BibTeX]
[DOI]
Alexander K. Kelmans
Discret. Math., 2001

On graph planarity and semi-duality.
[BibTeX]
[DOI]
Alexander K. Kelmans
Discret. Math., 2001

Asymptotically Optimal Tree-Packings in Regular Graphs.
[BibTeX]
[DOI]
Alexander K. Kelmans
,
Dhruv Mubayi
,
Benny Sudakov
Electron. J. Comb., 2001

2000
On convex embeddings of planar 3-connected graphs.
[BibTeX]
[DOI]
Alexander K. Kelmans
J. Graph Theory, 2000

Crossing properties of graph reliability functions.
[BibTeX]
[DOI]
Alexander K. Kelmans
J. Graph Theory, 2000

1999
On the distribution of eigenvalues of graphs.
[BibTeX]
[DOI]
Alexander K. Kelmans
,
Xuerong Yong
Discret. Math., 1999

1997
Star partitions of graphs.
[BibTeX]
[DOI]
Yoshimi Egawa
,
Mikio Kano
,
Alexander K. Kelmans
J. Graph Theory, 1997

Transformations of a Graph Increasing its Laplacian Polynomial and Number of Spanning Trees.
[BibTeX]
[DOI]
Alexander K. Kelmans
Eur. J. Comb., 1997

Optimal packing of induced stars in a graph.
[BibTeX]
[DOI]
Alexander K. Kelmans
Discret. Math., 1997

1996
On graphs with the maximum number of spanning trees.
[BibTeX]
[DOI]
Alexander K. Kelmans
Random Struct. Algorithms, 1996

Laplacian Spectra and Spanning Trees of Threshold Graphs.
[BibTeX]
[DOI]
Peter L. Hammer
,
Alexander K. Kelmans
Discret. Appl. Math., 1996

1994
On Edge Semi-Isomorphisms and Semi-Dualities of Graphs.
[BibTeX]
[DOI]
Alexander K. Kelmans
Graphs Comb., 1994

On Universal Threshold Graphs.
[BibTeX]
[DOI]
Peter L. Hammer
,
Alexander K. Kelmans
Comb. Probab. Comput., 1994

1992
Spanning trees of extended graphs.
[BibTeX]
[DOI]
Alexander K. Kelmans
Comb., 1992

1991
Graph planarity and related topics.
[BibTeX]
Alexander K. Kelmans
Proceedings of the Graph Structure Theory, 1991

1987
A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs.
[BibTeX]
[DOI]
Alexander K. Kelmans
Discret. Math., 1987

1984
A strengthening of the Kuratowski planarity criterion for 3-connected graphs.
[BibTeX]
[DOI]
Alexander K. Kelmans
Discret. Math., 1984

1983
On cycles through prescribed vertices in weakly separable graphs.
[BibTeX]
[DOI]
Alexander K. Kelmans
,
M. V. Lomonosov
Discret. Math., 1983

Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications.
[BibTeX]
[DOI]
Alexander K. Kelmans
,
Boris N. Kimelfeld
Discret. Math., 1983

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

When m vertices in a k-connected graph cannot be walked round along a simple cycle.
[BibTeX]
[DOI]
Alexander K. Kelmans
,
M. V. Lomonosov
Discret. Math., 1982

On 3-skein isomorphisms of graphs.
[BibTeX]
[DOI]
Robert L. Hemminger
,
Heinz Adolf Jung
,
Alexander K. Kelmans
Comb., 1982

1981
A new planarity criterion for 3-connected graphs.
[BibTeX]
[DOI]
Alexander K. Kelmans
J. Graph Theory, 1981

1980
Graphs with an extremal number of spanning trees.
[BibTeX]
[DOI]
Alexander K. Kelmans
J. Graph Theory, 1980

Concept of a vertex in a matroid and 3-connected graphs.
[BibTeX]
[DOI]
Alexander K. Kelmans
J. Graph Theory, 1980

1977
Nonisomorphic Trees with the Same T-Polynomial.
[BibTeX]
[DOI]
E. A. Dinic
,
Alexander K. Kelmans
,
M. A. Zaitsev
Inf. Process. Lett., 1977

1976
Comparison of graphs by their number of spanning trees.
[BibTeX]
[DOI]
Alexander K. Kelmans
Discret. Math., 1976


  Loading...