Michal Tkác

According to our database, Michal Tkác authored at least 19 papers between 1984 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

MachineLearnAthon: An Action-Oriented Machine Learning Didactic Concept.

Michal Tkác, Jakub Sieber, Lara Kuhlmann, Matthias Brueggenolte, Alexandru Rinciog, Michael Henke, Artur M. Schweidtmann, Qinghe Gao, Maximilian F. Theisen, Radwa El Shawi

CoRR, 2024

2016

Artificial neural networks in business: Two decades of research.

Michal Tkác, Robert Verner

Appl. Soft Comput., 2016

2011

Role of Trust Building Mechanisms as a Necessity Requirement of Entry to e-Business Environment.

Michal Tkác

Proceedings of the Interdisciplinarity in Complex Systems, 2011

2010

The Impacts of Specific ICT Solutions on Productivity.

Radoslav Delina, Michal Tkác

Proceedings of the Information Technology: Human Values, Innovation and Econoy, 2010

2006

On cycles through specified vertices.

Tobias Gerlach, Frank Göring, Jochen Harant, Michal Tkác

Discret. Math., 2006

On the degrees of a strongly vertex-magic graph.

Camino Balbuena, Ewan Barker, Kinkar Chandra Das, Yuqing Lin, Mirka Miller, Joseph F. Ryan, Slamin, Kiki A. Sugeng, Michal Tkác

Discret. Math., 2006

2002

On <i>k</i>-trestles in polyhedreal graphs.

Michal Tkác, Heinz-Jürgen Voss

Discuss. Math. Graph Theory, 2002

1999

More than one tough chordal planar graphs are Hamiltonian.

Thomas Böhme, Jochen Harant, Michal Tkác

J. Graph Theory, 1999

On certain Hamiltonian cycles in planar graphs.

Thomas Böhme, Jochen Harant, Michal Tkác

J. Graph Theory, 1999

On 3-Connected Plane Graphs without Triangular Faces.

Jochen Harant, Stanislav Jendrol', Michal Tkác

J. Comb. Theory, Ser. B, 1999

1998

On cubic polyhedral graphs with prescribed adjacency properties of their faces.

Peter Smutný, Michal Tkác

Discret. Math., 1998

1996

On the shortness exponent of 1-tough, maximal planar graphs.

Michal Tkác

Discret. Math., 1996

The irregularity strength and cost of the union of cliques.

Stanislav Jendrol', Michal Tkác, Zsolt Tuza

Discret. Math., 1996

5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one.

Jochen Harant, Peter J. Owens, Michal Tkác, Hansjoachim Walther

Discret. Math., 1996

1995

The irregularity strength of tK_p.

Stanislav Jendrol', Michal Tkác

Discret. Math., 1995

1994

On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles.

Michal Tkác

Discret. Math., 1994

1992

Shortness coefficients of simple 3-polytopal graphs with edges of only two types.

Michal Tkác

Discret. Math., 1992

1990

Convex 3-polytopes with exactly two types of edges.

Stanislav Jendrol', Michal Tkác

Discret. Math., 1990

1984

On the simplicial 3-polytopes with only two types of edges.

Stanislav Jendrol', Michal Tkác

Discret. Math., 1984