Alexander Kelmans

From MaRDI portal
Person:1367031

Available identifiers

zbMath Open kelmans.alexander-kMaRDI QIDQ1367031

List of research outcomes





PublicationDate of PublicationType
On the Quotient-Lift Matroid Relation2022-09-29Paper
Graphs with the same truncated cycle matroid2022-09-29Paper
ON $(\triangle, 1)$-GRAPHS2018-06-16Paper
\(k\)-circular matroids of graphs2017-05-12Paper
Laplacian spectra of digraph transformations2017-04-25Paper
On graphs uniquely defined by their \(K\)-circular matroids2017-03-15Paper
Adjacency polynomials of digraph transformations2016-05-02Paper
Spectra of digraph transformations2014-01-21Paper
Laplacian spectra of regular graph transformations2012-11-22Paper
On Convex Polytopes in the d-dimensional Space Containing and Avoiding Zero2012-01-21Paper
Operations on Graphs Increasing Some Graph Parameters2011-09-21Paper
Packing 3-vertex paths in claw-free graphs and related topics2011-01-21Paper
Packing 3-vertex Paths In Cubic 3-connected Graphs2009-10-14Paper
Generalizations of Abel's and Hurwitz's identities2008-09-04Paper
Packing 3-vertex paths in cubic 3-connected graphs2008-01-07Paper
Packing 3-Vertex Paths in 2-Connected Graphs2007-12-26Paper
Packing 3-Vertex Paths in Claw-Free Graphs2007-11-24Paper
Packingk-edge trees in graphs of restricted vertex degrees2007-08-09Paper
On Hamiltonicity of \{claw, net\}-free graphs2006-10-30Paper
On the Cycle Space of a 3--Connected Graph2006-09-07Paper
Counterexamples to the Cubic Graph Domination Conjecture2006-07-20Paper
Simple and Direct Proof of MacLane's Planarity Criterion2006-07-06Paper
How many disjoint 2-edge paths must a cubic graph have?2004-02-03Paper
On graph closures2003-09-25Paper
On the Laplacian spectrum of (\(\alpha,\omega\))-graphs2003-03-18Paper
On homotopy of connected graphs having the same degree function2002-01-08Paper
Asymptotically optimal tree-packings in regular graphs2001-12-11Paper
On the distribution of eigenvalues of graphs2001-10-30Paper
On graph planarity and semi-duality2001-08-27Paper
Crossing properties of graph reliability functions2001-07-16Paper
On packing 3-vertex paths in a graph2001-01-01Paper
On convex embeddings of planar 3-connected graphs2000-03-22Paper
https://portal.mardi4nfdi.de/entity/Q43932931998-06-08Paper
Optimal packing of induced stars in a graph1998-04-28Paper
https://portal.mardi4nfdi.de/entity/Q43442051997-12-08Paper
Transformations of a graph increasing its Laplacian polynomial and number of spanning trees1997-10-20Paper
https://portal.mardi4nfdi.de/entity/Q43479011997-08-11Paper
Laplacian spectra and spanning trees of threshold graphs1997-04-21Paper
https://portal.mardi4nfdi.de/entity/Q48946081996-11-12Paper
https://portal.mardi4nfdi.de/entity/Q48711481996-08-18Paper
On Universal Threshold Graphs1995-03-09Paper
On edge semi-isomorphisms and semi-dualities of graphs1995-02-01Paper
https://portal.mardi4nfdi.de/entity/Q43052311994-09-25Paper
https://portal.mardi4nfdi.de/entity/Q43052301994-09-25Paper
https://portal.mardi4nfdi.de/entity/Q43038781994-09-25Paper
https://portal.mardi4nfdi.de/entity/Q43052291994-09-25Paper
https://portal.mardi4nfdi.de/entity/Q42738761994-07-03Paper
Spanning trees of extended graphs1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40063031992-09-26Paper
https://portal.mardi4nfdi.de/entity/Q39793191992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q38122601988-01-01Paper
Matroids and the theorems of Whitney on 2-isomorphism and planarity of graphs1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38183521988-01-01Paper
Cubic bipartite cyclic 4-connected graphs without Hamiltonian circuits1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37927141987-01-01Paper
A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33638001987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37588701986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47352031986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36934541985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47257501985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37141201984-01-01Paper
A strengthening of the Kuratowski planarity criterion for 3-connected graphs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37170941984-01-01Paper
Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications1983-01-01Paper
On cycles through prescribed vertices in weakly separable graphs1983-01-01Paper
On 3-skein isomorphisms of graphs1982-01-01Paper
When m vertices in a k-connected graph cannot be walked round along a simple cycle1982-01-01Paper
A cubic 3-connected graph having no cycle through given 10 vertices has the “Petersen form”1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39608811982-01-01Paper
On graphs with randomly deleted edges1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39569751981-01-01Paper
A new planarity criterion for 3-connected graphs1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39314471981-01-01Paper
Concept of a vertex in a matroid and 3-connected graphs1980-01-01Paper
Graphs with an extremal number of spanning trees1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38536401980-01-01Paper
Erratum: A certain polynomial of a graph and graphs with an extremal number of trees1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39197351978-01-01Paper
Nonisomorphic trees with the same T-polynomial1977-01-01Paper
Comparison of graphs by their number of spanning trees1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41418281976-01-01Paper
Число Деревьев Графа, Содержащих Заднный Лес1976-01-01Paper
A certain polynomial of a graph and graphs with an extremal number of trees1974-01-01Paper
Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs1972-01-01Paper
Connectivity of graphs having vertices which drop out randomly1972-01-01Paper
Bounds on the probability characteristics of random graphs1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55949551970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56116481970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55464381967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56026841967-01-01Paper
The number of trees in a graph. I. II1966-01-01Paper
Some problems of network reliability analysis1965-01-01Paper
The reliability of information-transmission systems of arbitrary structure, taking into account the value of the information transmitted1964-01-01Paper
Design of data transmission structures with optimal reliability1964-01-01Paper

Research outcomes over time

This page was built for person: Alexander Kelmans