Alexander Kelmans

Follow

Generating author description...

All published works
Action Title Year Authors
+ On the Quotient-Lift Matroid Relation 2022 JosĂ© de JesĂșs
Alexander Kelmans
+ Graphs with the same truncated cycle matroid 2022 JosĂ© de JesĂșs
Alexander Kelmans
+ ON $(\triangle, 1)$-GRAPHS 2018 Rafael Aparicio
Alexander Kelmans
+ ON $(\triangle, 1)$-GRAPHS 2018 Rafael Aparicio
Alexander Kelmans
+ Spectra of Digraph Transformations 2017 Aiping Deng
Alexander Kelmans
+ Laplacian spectra of digraph transformations 2016 Aiping Deng
Alexander Kelmans
+ Adjacency polynomials of digraph transformations 2016 Aiping Deng
Mengyu Feng
Alexander Kelmans
+ On graphs uniquely defined by their $k$-circular matroids 2015 JosĂ© F. De JesĂșs
Alexander Kelmans
+ K-Circular Matroids of Graphs 2015 JosĂ© F. De JesĂșs
Alexander Kelmans
+ On graphs uniquely defined by their $k$-circular matroids 2015 JosĂ© F. De JesĂșs
Alexander Kelmans
+ K-Circular Matroids of Graphs 2015 JosĂ© F. De JesĂșs
Alexander Kelmans
+ Spectra of digraph transformations 2013 Aiping Deng
Alexander Kelmans
+ On convex polytopes in<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msup></mml:math>containing and avoiding zero 2012 Alexander Kelmans
Anatoly R. Rubinov
+ PDF Chat Laplacian spectra of regular graph transformations 2012 Aiping Deng
Alexander Kelmans
Juan Meng
+ On Convex Polytopes in the d-dimensional Space Containing and Avoiding Zero 2012 Alexander Kelmans
Anatoliy Rubinov
+ On Convex Polytopes in the d-dimensional Space Containing and Avoiding Zero 2012 Alexander Kelmans
Anatoliy Rubinov
+ Operations on Graphs Increasing Some Graph Parameters 2011 Alexander Kelmans
+ Packing 3-vertex paths in claw-free graphs and related topics 2010 Alexander Kelmans
+ Packing 3-vertex Paths In Cubic 3-connected Graphs 2009 Alexander Kelmans
+ PDF Chat Generalizations of Abel’s and Hurwitz’s identities 2008 Alexander Kelmans
Alexander Postnikov
+ Packing 3-vertex paths in cubic 3-connected graphs 2008 Alexander Kelmans
+ PDF Chat Packing <i>k</i>‐edge trees in graphs of restricted vertex degrees 2007 Alexander Kelmans
+ Packing 3-Vertex Paths in Claw-Free Graphs 2007 Alexander Kelmans
+ Packing 3-Vertex Paths in 2-Connected Graphs 2007 Alexander Kelmans
+ Counterexamples to the Cubic Graph Domination Conjecture 2006 Alexander Kelmans
+ Simple and Direct Proof of MacLane's Planarity Criterion 2006 Alexander Kelmans
+ On the Cycle Space of a 3--Connected Graph 2006 Alexander Kelmans
+ On Hamiltonicity of {claw, net}-free graphs 2006 Alexander Kelmans
+ Packing k-edge Trees in Graphs of Restricted Vertex Degrees 2006 Alexander Kelmans
+ How many disjoint 2-edge paths must a cubic graph have? 2004 Alexander Kelmans
Dhruv Mubayi
+ How many disjoint 2‐edge paths must a cubic graph have? 2003 Alexander Kelmans
Dhruv Mubayi
+ On graph closures 2003 Alexander Kelmans
+ On the Laplacian Spectrum of (α, ω) -Graphs 2002 Alexander Kelmans
+ On the Laplacian Spectrum of (alpha, omega) -Graphs. 2002 Alexander Kelmans
+ PDF Chat Asymptotically Optimal Tree-Packings in Regular Graphs 2001 Alexander Kelmans
Dhruv Mubayi
Benny Sudakov
+ Crossing properties of graph reliability functions 2000 Alexander Kelmans
+ Crossing properties of graph reliability functions 2000 Alexander Kelmans
+ Crossing properties of graph reliability functions 2000 Alexander Kelmans
+ On the distribution of eigenvalues of graphs 1999 Alexander Kelmans
Xuerong Yong
+ Optimal packing of induced stars in a graph 1997 Alexander Kelmans
+ Star partitions of graphs 1997 Yoshimi Egawa
Mikio Kanƍ
Alexander Kelmans
+ Transformations of a Graph Increasing its Laplacian Polynomial and Number of Spanning Trees 1997 Alexander Kelmans
+ On graphs with the maximum number of spanning trees 1996 Alexander Kelmans
+ On graphs with the maximum number of spanning trees 1996 Alexander Kelmans
+ Laplacian spectra and spanning trees of threshold graphs 1996 P. L. Hammer
Alexander Kelmans
+ On Universal Threshold Graphs 1994 P. L. Hammer
Alexander Kelmans
+ Cubic bipartite cyclic 4-connected graphs without Hamiltonian circuits 1988 Alexander Kelmans
+ A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs 1987 Alexander Kelmans
+ On cycles through prescribed vertices in weakly separable graphs 1983 Alexander Kelmans
M. V. Lomonosov
+ Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications 1983 Alexander Kelmans
Boris Kimelfeld
+ When m vertices in a k-connected graph cannot be walked round along a simple cycle 1982 Alexander Kelmans
M. V. Lomonosov
+ On graphs with randomly deleted edges 1981 Alexander Kelmans
+ Nonisomorphic trees with the same T-polynomial 1977 E.A. Dinic
Alexander Kelmans
M. A. Zaitsev
+ Asymptotic Formulas for the Probability of <i>k</i>-Connectedness of Random Graphs 1973 Alexander Kelmans
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ On graphs with the maximum number of spanning trees 1996 Alexander Kelmans
5
+ On graph closures 2003 Alexander Kelmans
5
+ Spectra of graphs : theory and application 1995 Dragoơ Cvetković
Michael Doob
H. Sachs
5
+ How many disjoint 2-edge paths must a cubic graph have? 2004 Alexander Kelmans
Dhruv Mubayi
5
+ An extension of matching theory 1986 Gérard Cornuéjols
David Hartvigsen
5
+ Packings by Complete Bipartite Graphs 1986 Pavol Hell
David Kirkpatrick
5
+ Transformations of a Graph Increasing its Laplacian Polynomial and Number of Spanning Trees 1997 Alexander Kelmans
4
+ Optimal packing of induced stars in a graph 1997 Alexander Kelmans
4
+ Characteristic polynomials of some graph coverings 1995 Hirobumi Mizuno
Iwao Sato
4
+ Spectra of graphs 1980 Cvetkovi cacute
Mikhina Vs
Michael Doob
H. Sachs
4
+ Homomorphisms, representations and characteristic polynomials of digraphs 2007 Aiping Deng
Iwao Sato
Yaokun Wu
4
+ An extension of Tutte's 1-factor theorem 1978 Michel Las Vergnas
4
+ Spectra of transformation graphs of regular graph 2008 Juan Yan
XU Ke-xiang
4
+ Spectra of transformation digraphs of a regular digraph 2009 Juan Liu
Jixiang Meng
4
+ Graphs with an extremal number of spanning trees 1980 A. K. Kelmans
4
+ Characteristic polynomials of digraphs having a semi-free action 2005 Aiping Deng
Yaokun Wu
4
+ Counterexamples to the Cubic Graph Domination Conjecture 2006 Alexander Kelmans
3
+ Note on Isomorphisms of Graphs 1967 R. Halin
H. A. Jung
3
+ How many disjoint 2‐edge paths must a cubic graph have? 2003 Alexander Kelmans
Dhruv Mubayi
3
+ PDF Chat Asymptotically Optimal Tree-Packings in Regular Graphs 2001 Alexander Kelmans
Dhruv Mubayi
Benny Sudakov
3
+ Efficient Subgraph Packing 1993 Martin Loebl
S. Poljak
3
+ Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs 2005 Yaokun Wu
Aiping Deng
3
+ PDF Chat Laplacian spectra of regular graph transformations 2012 Aiping Deng
Alexander Kelmans
Juan Meng
3
+ On the Complexity of General Graph Factor Problems 1983 David Kirkpatrick
Pavol Hell
3
+ On graphs with randomly deleted edges 1981 Alexander Kelmans
3
+ A review of random graphs 1982 MichaƂ KaroƄski
2
+ Star partitions of graphs 1997 Yoshimi Egawa
Mikio Kanƍ
Alexander Kelmans
2
+ PDF Chat Graphs and their spectra 1989 J.J. Seidel
2
+ Spectra of digraph transformations 2013 Aiping Deng
Alexander Kelmans
2
+ Laplacian spectra and spanning trees of threshold graphs 1996 P. L. Hammer
Alexander Kelmans
2
+ A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two 2003 Atsushi Kaneko
2
+ 4‐chrome Graphen und vollstĂ€ndige 4‐Graphen 1960 G. A. Dirac
2
+ On the Abstract Properties of Linear Dependence1 2009 Hassler Whitney
2
+ On a Closure Concept in Claw-Free Graphs 1997 Zdeněk Ryjáček
2
+ None 2007 Douglas C. Bauer
Hajo Broersma
A. Morgana
E. Schmeichel
2
+ The characteristic polynomial of a graph 1972 Abbe Mowshowitz
2
+ Graph‐theoretic parameters concerning domination, independence, and irredundance 1979 B. Bollobás
E. J. Cockayne
1
+ The distribution of eigenvalues of graphs 1995 Dasong Cao
Hong Yuan
1
+ Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture 1997 Dorit Dor
Michael Tarsi
1
+ K-Circular Matroids of Graphs 2015 JosĂ© F. De JesĂșs
Alexander Kelmans
1
+ PDF Chat Algebraic connectivity of graphs 1973 Miroslav Fiedler
1
+ On factors with given components 1982 Atsushi Amahashi
Mikio Kanƍ
1
+ On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs 1969 David Barnette
1
+ Hamiltonian results in <i>K</i><sub>1,3</sub>‐free graphs 1984 Manton M. Matthews
David P. Sumner
1
+ Developments in the theory of graph spectra 1985 Dragoơ Cvetković
Michael Doob
1
+ Packing 3-Vertex Paths in 2-Connected Graphs 2007 Alexander Kelmans
1
+ Threshold Graphs and Related Topics 1995 N. V. R. Mahadev
Uri N. Peled
1
+ Partial Matroid Representations 1984 Klaus Truemper
1
+ Universal graphs and induced‐universal graphs 1990 Fan Chung
1
+ On characterizing certain graphs with four eigenvalues by their spectra 1970 Michael Doob
1