The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michal Tkác: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Camino Balbuena, E. Barker, K. C. Das, Yuqing Lin, Mirka Miller, Joseph F. Ryan, Slamin, K. A. Sugeng, Michal Tkác
    On the degrees of a strongly vertex-magic graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:6, pp:539-551 [Journal]
  2. Tobias Gerlach, Frank Göring, Jochen Harant, Michal Tkác
    On cycles through specified vertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:8-9, pp:831-835 [Journal]
  3. Jochen Harant, Stanislav Jendrol, Michal Tkác
    On 3-Connected Plane Graphs without Triangular Faces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:77, n:1, pp:150-161 [Journal]
  4. Stanislav Jendrol, Michal Tkác
    On the simplicial 3-polytopes with only two types of edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:48, n:2-3, pp:229-241 [Journal]
  5. Peter Smutný, Michal Tkác
    On cubic polyhedral graphs with prescribed adjacency properties of their faces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:197-206 [Journal]
  6. Stanislav Jendrol, Michal Tkác
    Convex 3-polytopes with exactly two types of edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:2, pp:143-160 [Journal]
  7. Michal Tkác
    Shortness coefficients of simple 3-polytopal graphs with edges of only two types. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:103, n:1, pp:103-110 [Journal]
  8. Stanislav Jendrol, Michal Tkác
    The irregularity strength of tKp. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:145, n:1-3, pp:301-305 [Journal]
  9. Stanislav Jendrol, Michal Tkác, Zsolt Tuza
    The irregularity strength and cost of the union of cliques. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:179-186 [Journal]
  10. Jochen Harant, Peter J. Owens, Michal Tkác, Hansjoachim Walther
    5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:143-153 [Journal]
  11. Michal Tkác
    On the shortness exponent of 1-tough, maximal planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:154, n:1-3, pp:321-328 [Journal]
  12. Michal Tkác
    On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:128, n:1-3, pp:407-413 [Journal]

Search in 0.003secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002