The SCEAS System
| |||||||

## Search the dblp DataBase
Alexander K. Kelmans:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Alexander K. Kelmans
**Graph planarity and related topics.**[Citation Graph (0, 0)][DBLP] Graph Structure Theory, 1991, pp:635-668 [Conf] - Robert L. Hemminger, Heinz Adolf Jung, Alexander K. Kelmans
**On 3-skein isomorphisms of graphs.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1982, v:2, n:4, pp:373-376 [Journal] - Alexander K. Kelmans
**Spanning trees of extended graphs.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1992, v:12, n:1, pp:45-51 [Journal] - Alexander K. Kelmans, Dhruv Mubayi, Benny Sudakov
**Asymptotically Optimal Tree-Packings in Regular Graphs.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal] - Peter L. Hammer, Alexander K. Kelmans
**On Universal Threshold Graphs.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1994, v:3, n:, pp:327-344 [Journal] - Peter L. Hammer, Alexander K. Kelmans
**Laplacian Spectra and Spanning Trees of Threshold Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:255-273 [Journal] - Alexander K. Kelmans
**On graph planarity and semi-duality.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:230, n:1-3, pp:149-166 [Journal] - Alexander K. Kelmans
**On Homotopy of connected graphs having the same degree function.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:230, n:1-3, pp:167-187 [Journal] - Alexander K. Kelmans
**On graph closures.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:271, n:1-3, pp:141-168 [Journal] - Alexander K. Kelmans
**On Hamiltonicity of {claw, net}-free graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:21, pp:2755-2761 [Journal] - Alexander K. Kelmans
**On the Laplacian Spectrum of (alpha, omega) -Graphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2002, v:23, n:6, pp:673-682 [Journal] - Alexander K. Kelmans
**Transformations of a Graph Increasing its Laplacian Polynomial and Number of Spanning Trees.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1997, v:18, n:1, pp:35-48 [Journal] - E. A. Dinic, Alexander K. Kelmans, M. A. Zaitsev
**Nonisomorphic Trees with the Same T-Polynomial.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1977, v:6, n:3, pp:73-76 [Journal] - Alexander K. Kelmans
**On graphs with the maximum number of spanning trees.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1996, v:9, n:1-2, pp:177-192 [Journal] - Alexander K. Kelmans, Dhruv Mubayi
**How many disjoint 2-edge paths must a cubic graph have?**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2004, v:45, n:1, pp:57-79 [Journal] - Alexander K. Kelmans, M. V. Lomonosov
**When m vertices in a k-connected graph cannot be walked round along a simple cycle.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:38, n:2-3, pp:317-322 [Journal] - Alexander K. Kelmans, B. N. Kimelfeld
**Multiplicative submodularity of a matrix's principal minor as a function of the set of its rows and some combinatorial applications.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1983, v:44, n:1, pp:113-116 [Journal] - Alexander K. Kelmans
**A strengthening of the Kuratowski planarity criterion for 3-connected graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1984, v:51, n:3, pp:215-220 [Journal] - Alexander K. Kelmans
**A short proof and a strengthening of the Whitney 2-isomorphism theorem on graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1987, v:64, n:1, pp:13-25 [Journal] - Alexander K. Kelmans, M. V. Lomonosov
**On cycles through prescribed vertices in weakly separable graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1983, v:46, n:2, pp:183-189 [Journal] - Alexander K. Kelmans, Xuerong Yong
**On the distribution of eigenvalues of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:199, n:1-3, pp:251-258 [Journal] - Alexander K. Kelmans
**Optimal packing of induced stars in a graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:173, n:1-3, pp:97-127 [Journal] **Generalizations of Abel's and Hurwitz's identities.**[Citation Graph (, )][DBLP]
Search in 0.000secs, Finished in 0.001secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |