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