default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander K. Kelmans
- > Home > Persons > Alexander K. Kelmans
Publications
- 2011
[j34]Alexander K. Kelmans:
Packing 3-vertex paths in claw-free graphs and related topics. Discret. Appl. Math. 159(2-3): 112-127 (2011)- [i2]Alexander K. Kelmans:
Operations on Graphs Increasing Some Graph Parameters. CoRR abs/1109.4622 (2011) - 2009
- [i1]Alexander K. Kelmans:
Packing 3-vertex paths in claw-free graphs and related topics. CoRR abs/0910.4681 (2009) - 2007
- [j32]Alexander K. Kelmans:
Packing k-edge trees in graphs of restricted vertex degrees. J. Graph Theory 55(4): 306-324 (2007) - 2006
- [j31]Alexander K. Kelmans:
On Hamiltonicity of {claw, net}-free graphs. Discret. Math. 306(21): 2755-2761 (2006) - 2003
- [j29]Alexander K. Kelmans:
On graph closures. Discret. Math. 271(1-3): 141-168 (2003) - 2002
- [j28]Alexander K. Kelmans:
On the Laplacian Spectrum of (alpha, omega) -Graphs. Eur. J. Comb. 23(6): 673-682 (2002) - 2001
- [j26]Alexander K. Kelmans:
On graph planarity and semi-duality. Discret. Math. 230(1-3): 149-166 (2001) - [j25]Alexander K. Kelmans:
On Homotopy of connected graphs having the same degree function. Discret. Math. 230(1-3): 167-187 (2001) - 2000
- [j23]Alexander K. Kelmans:
On convex embeddings of planar 3-connected graphs. J. Graph Theory 33(2): 120-124 (2000) - [j22]Alexander K. Kelmans:
Crossing properties of graph reliability functions. J. Graph Theory 35(3): 206-221 (2000) - 1997
- [j20]Alexander K. Kelmans:
Optimal packing of induced stars in a graph. Discret. Math. 173(1-3): 97-127 (1997) - [j19]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
- [j16]Alexander K. Kelmans:
On graphs with the maximum number of spanning trees. Random Struct. Algorithms 9(1-2): 177-192 (1996) - 1994
- [j14]Alexander K. Kelmans:
On Edge Semi-Isomorphisms and Semi-Dualities of Graphs. Graphs Comb. 10(2-4): 337-352 (1994) - 1992
- [j13]Alexander K. Kelmans:
Spanning trees of extended graphs. Comb. 12(1): 45-51 (1992) - 1991
- [c1]Alexander K. Kelmans:
Graph planarity and related topics. Graph Structure Theory 1991: 635-667 - 1987
- [j12]Alexander K. Kelmans:
A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs. Discret. Math. 64(1): 13-25 (1987) - 1984
- [j11]Alexander K. Kelmans:
A strengthening of the Kuratowski planarity criterion for 3-connected graphs. Discret. Math. 51(3): 215-220 (1984) - 1981
- [j5]Alexander K. Kelmans:
A new planarity criterion for 3-connected graphs. J. Graph Theory 5(3): 259-267 (1981) - 1980
- [j4]Alexander K. Kelmans:
Concept of a vertex in a matroid and 3-connected graphs. J. Graph Theory 4(1): 13-19 (1980) - [j3]Alexander K. Kelmans:
Graphs with an extremal number of spanning trees. J. Graph Theory 4(1): 119-122 (1980) - 1976
- [j1]Alexander K. Kelmans:
Comparison of graphs by their number of spanning trees. Discret. Math. 16(3): 241-261 (1976)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
