Alexander K. Kelmans - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 38 from 38

2017

On graphs uniquely defined by their K-circular matroidsJosé F. De Jesús, Alexander K. Kelmans. DAM, 217:474-487, 2017. [doi]

k-circular matroids of graphsJosé F. De Jesús, Alexander K. Kelmans. DAM, 225:33-50, 2017. [doi]

2016

Adjacency polynomials of digraph transformationsAiping Deng, Mengyu Feng, Alexander K. Kelmans. DAM, 206:15-38, 2016. [doi]

2013

Laplacian spectra of regular graph transformationsAiping Deng, Alexander K. Kelmans, Juan Meng. DAM, 161(1-2):118-133, 2013. [doi]

On convex polytopes in Rd containing and avoiding zeroAlexander K. Kelmans, Anatoliy Rubinov. ejc, 34(4):764-769, 2013. [doi]

2011

Packing 3-vertex paths in claw-free graphs and related topicsAlexander K. Kelmans. DAM, 159(2-3):112-127, 2011. [doi]

2008

Generalizations of Abel s and Hurwitz s identitiesAlexander K. Kelmans, Alexander Postnikov. ejc, 29(7):1535-1543, 2008. [doi]

2007

Packing ::::k::::-edge trees in graphs of restricted vertex degreesAlexander K. Kelmans. jgt, 55(4):306-324, 2007. [doi]

2006

On Hamiltonicity of {claw, net}-free graphsAlexander K. Kelmans. DM, 306(21):2755-2761, 2006. [doi]

2004

How many disjoint 2-edge paths must a cubic graph have?Alexander K. Kelmans, Dhruv Mubayi. jgt, 45(1):57-79, 2004. [doi]

2003

On graph closuresAlexander K. Kelmans. DM, 271(1-3):141-168, 2003. [doi]

2002

On the Laplacian Spectrum of (alpha, omega) -GraphsAlexander K. Kelmans. ejc, 23(6):673-682, 2002. [doi]

2001

On packing 3-vertex paths in a graphAtsushi Kaneko, Alexander K. Kelmans, Tsuyoshi Nishimura. jgt, 36(4):175-197, 2001. [doi]

On Homotopy of connected graphs having the same degree functionAlexander K. Kelmans. DM, 230(1-3):167-187, 2001. [doi]

On graph planarity and semi-dualityAlexander K. Kelmans. DM, 230(1-3):149-166, 2001. [doi]

Asymptotically Optimal Tree-Packings in Regular GraphsAlexander K. Kelmans, Dhruv Mubayi, Benny Sudakov. combinatorics, 8(1), 2001. [doi]

2000

Crossing properties of graph reliability functionsAlexander K. Kelmans. jgt, 35(3):206-221, 2000. [doi]

On convex embeddings of planar 3-connected graphsAlexander K. Kelmans. jgt, 33(2):120-124, 2000. [doi]

1999

On the distribution of eigenvalues of graphsAlexander K. Kelmans, Xuerong Yong. DM, 199(1-3):251-258, 1999. [doi]

1997

Star partitions of graphsYoshimi Egawa, M. Kano, Alexander K. Kelmans. jgt, 25(3):185-190, 1997. [doi]

Optimal packing of induced stars in a graphAlexander K. Kelmans. DM, 173(1-3):97-127, 1997. [doi]

Transformations of a Graph Increasing its Laplacian Polynomial and Number of Spanning TreesAlexander K. Kelmans. ejc, 18(1):35-48, 1997. [doi]

1996

Laplacian Spectra and Spanning Trees of Threshold GraphsPeter L. Hammer, Alexander K. Kelmans. DAM, 65(1-3):255-273, 1996. [doi]

On graphs with the maximum number of spanning treesAlexander K. Kelmans. rsa, 9(1-2):177-192, 1996.

1994

On Universal Threshold GraphsPeter L. Hammer, Alexander K. Kelmans. cpc, 3:327-344, 1994.

On Edge Semi-Isomorphisms and Semi-Dualities of GraphsAlexander K. Kelmans. gc, 10(2-4):337-352, 1994. [doi]

1992

Spanning trees of extended graphsAlexander K. Kelmans. combinatorica, 12(1):45-51, 1992.

1991

Graph planarity and related topicsAlexander K. Kelmans. gst 1993: 635-668

1987

A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphsAlexander K. Kelmans. DM, 64(1):13-25, 1987. [doi]

1983

On cycles through prescribed vertices in weakly separable graphsAlexander K. Kelmans, M. V. Lomonosov. DM, 46(2):183-189, 1983. [doi]

1982

On 3-skein isomorphisms of graphsRobert L. Hemminger, Heinz Adolf Jung, Alexander K. Kelmans. combinatorica, 2(4):373-376, 1982.

When m vertices in a k-connected graph cannot be walked round along a simple cycleAlexander K. Kelmans, M. V. Lomonosov. DM, 38(2-3):317-322, 1982. [doi]

A cubic 3-connected graph having no cycle through given 10 vertices has the "Petersen form"Alexander K. Kelmans, M. V. Lomonosov. jgt, 6(4):495-496, 1982. [doi]

1981

A new planarity criterion for 3-connected graphsAlexander K. Kelmans. jgt, 5(3):259-267, 1981. [doi]

1980

Graphs with an extremal number of spanning treesAlexander K. Kelmans. jgt, 4(1):119-122, 1980. [doi]

Concept of a vertex in a matroid and 3-connected graphsAlexander K. Kelmans. jgt, 4(1):13-19, 1980. [doi]

1977

Nonisomorphic Trees with the Same T-PolynomialE. A. Dinic, Alexander K. Kelmans, M. A. Zaitsev. ipl, 6(3):73-76, 1977.

1976

Comparison of graphs by their number of spanning treesAlexander K. Kelmans. DM, 16(3):241-261, 1976. [doi]

Sign in or sign up to see more results.

runs on WebDSL