The scientific and research focus of the team is the study of combinatorial properties of discrete structures, especially the structure and chromatic properties of graphs (plane or embedded into surfaces), the problems of graph labellings and long cycles in graphs. The team is very well composed, both professionally and in the age; its h-index is at least 19.<\/p>\n
The leader of the team is prof. RNDr. Stanislav Jendro\u013e, DrSc. He is student of prof. Jucovi\u010d and experienced scientific and pedagogical personality with a wide range of scientific interests. In 2009, was ranked as a top Slovak mathematician by the Slovak academic rating agency ARRA. As a\u00a0scientist, he wrote (alone or with co-authors) more than 160 original scientific papers published in leading world journals, in which he described a number of new important results on various geometric, topological and combinatorial objects. He significantly contributed to the characterization of the facial and vertex structure of convex polyhedra and polyhedral maps. He described the first known example of a convex polyhedron with non-involutory self-duality (the so-called Jendro\u013e polyhedron). He discovered (with I.\u00a0Fabrici, M.\u00a0Macekov\u00e1, T.\u00a0Madaras, M.\u00a0Tuh\u00e1rsky, R.\u00a0Sot\u00e1k and foreign colleagues J.\u00a0Harant, H.-J.\u00a0Voss, H.\u00a0Walther) fundamental knowledge about the structure of plane graphs and graphs embedded into orientable surfaces; this led to the foundations of light graph theory, which is currently intensively developed by several research groups around the world. He solved the problem of P.\u00a0Erd\u00f6s on the minimum edge weight in the graphs with the prescribed number of vertices and edges (co-author I.\u00a0Schiermeyer) and together with M.\u00a0Trenkler, he solved the problem of theoretical chemistry on possible existence of molecules of fulleroids with prescribed geometric structure. He contributed (co-author F.\u00a0Kardo\u0161) to deeper understanding of the geometric structure of fullerene and fulleroid molecules. He initiated the study of the total labellings of graphs (co-authors M.\u00a0Ba\u010da, M.\u00a0Miller, J.\u00a0Ryan) and discovered (with co-authors J.\u00a0Ivan\u010do, J.\u00a0Mi\u0161kuf,\u00a0 R.\u00a0Sot\u00e1k) numerous properties of the irregular total labellings of graphs. Publications devoted to this topic encountered a vivid response in the world; scientific databases provide more than 85 SCI citations for the principal work of the topic. In cooperation with the co-authors (J.\u00a0Czap, I.\u00a0Fabrici, J.\u00a0Harant, F.\u00a0Kardo\u0161, R.\u00a0Sot\u00e1k, E.\u00a0\u0160krabu\u013e\u00e1kov\u00e1, J.\u00a0Valiska, M.\u00a0Voigt, M.\u00a0Vrbjarov\u00e1), he the foundations of another viable topic \u2013 theory of facial colourings of plane graphs, for which the coloring restrictions concern the graph faces (cyclic, odd, non-repetitive, total, unique-maximum, conflict-free, anagram-free, packing, ranking, WORM, etc.). Until now, he has supervised 17 PhD. (or its equivalent academic titles) students.<\/p>\n
Another key member of the team is prof. RNDr. Mirko Hor\u0148\u00e1k, CSc., the student of prof. Jucovi\u010d. During post-graduate study, he primarily worked on cell decompositions of orientable surfaces. Later, his scientific interest focused mainly on the chromatic theory of graphs. He obtained significant results on the cyclic chromatic number (co-authors H.\u00a0Enomoto, S.\u00a0Jendro\u013e, J.\u00a0Zl\u00e1malov\u00e1). He initiated the study of certain chromatic invariants like observability (co-authors J.\u00a0\u010cern\u00fd, R.\u00a0Sot\u00e1k) and the palette index (co-authors R.\u00a0Kalinowski, M.\u00a0Meszka, M.\u00a0Wo\u017aniak). He obtained several results on the achromatic number and achromatic index (co-authors \u0160.\u00a0P\u010dola, J.\u00a0Puntig\u00e1n, M.\u00a0Wo\u017aniak). He also dealt with the structural problems of the theory of graphs, namely those ones concerning edge weights in graphs (co-authors A.\u00a0Gajdo\u0161, P.\u00a0Hud\u00e1k, J.\u00a0Ivan\u010do, S.\u00a0Jendro\u013e, T.\u00a0Madaras, I.\u00a0Schiermeyer) and decompositions to graphs of prescribed properties (co-authors S.\u00a0Cichacz, Z.\u00a0Kockov\u00e1, A.\u00a0Marczyk, I.\u00a0Schiermeyer, M.\u00a0Wo\u017aniak, Zs.\u00a0Tuza). Until now, he has supervised five PhD. students.<\/p>\n
The middle generation in KOSDIM is represented by doc. RNDr. Tom\u00e1\u0161 Madaras, PhD., doc. RNDr. Gabriel Semani\u0161in, doc. RNDr. Roman Sot\u00e1k, PhD. and RNDr. Igor Fabrici, Dr. rer. nat.<\/p>\n
Doc. Madaras is student of prof. Jendro\u013e. The central theme of his research is the structure of planar and plane graphs or graphs that are geometrically similar to them (co-authors I.\u00a0Fabrici, D.\u00a0Hud\u00e1k, J.\u00a0Czap, Y.\u00a0Suzuki), both from the local (the existence of specific small configurations in graphs) as well as from the global point of view (properties of large subgraphs). His other works are devoted to the structure of social or complex networks, namely to the study of mathematical properties of quantitative measures of importance of actors or actor ties within a network (centrality indexes) and detection of communities in the network (co-authors J.\u00a0Coroni\u010dov\u00e1 Hurajov\u00e1, S.\u00a0Gago). Part of his research (co-author P.\u00a0\u0160iroczki) also concerns the specific possibilities of graph representations in metric or Euclidean spaces, and graph colourings. Until now, he has supervised three PhD. Students.<\/p>\n
Doc. Semani\u0161in is student of doc. RNDr. Peter Mih\u00f3k, CSc. Under his supervision, he became an expert in the study of hereditary and additive properties of graphs, which naturally generalize the vertex and edge colourings of general graphs (co-authors M.\u00a0Borowiecki, I.\u00a0Broere, P.\u00a0Mih\u00f3k, R.\u00a0Vasky, A.\u00a0Farrugia, B.\u00a0Richter). He is very successful in applications of these generalized colourings in algorithmic graph theory. Recently, he studies the minimal path vertex covering (co-authors B.\u00a0Bre\u0161ar, M.\u00a0Jakovac, F.\u00a0Kardo\u0161, J.\u00a0Katreni\u010d, A.\u00a0Taranenko), that provides a generalisation of minimum vertex cover, and generalised scheduling problems motivated by various aspects of communications in networks (co-authors F.\u00a0Gal\u010d\u00edk, J.\u00a0Katreni\u010d).<\/p>\n
Doc. Sot\u00e1k is student of prof. Hor\u0148\u00e1k. He is creative and active member of team, with a wide scientific range. Together with M.\u00a0Hor\u0148\u00e1k, he explored several types of edge colouring graphs that distinguish the vertices by colour sets, and later, with his PhD. student J.\u00a0Ruda\u0161ov\u00e1 he obtained results for a specific variant of the above colouring which assumes the uniform use of all colors. Many results in the chromatic theory of graphs (concerning colourings forbidding certain bichromatic subgraphs) were published in co-operation with another PhD. student M.\u00a0Mockov\u010diakov\u00e1, colleagues from Slovenia (B.\u00a0Lu\u017ear, R.\u00a0\u0160krekovski, J.\u00a0Kranjc) and other co-authors (F.\u00a0Kardo\u0161, D.\u00a0Hud\u00e1k, \u013d.\u00a0Bezegov\u00e1). He participated in generalization of fractional and circular colourings (also their total version) for hereditary and additive properties (co-authors P.\u00a0Mih\u00f3k, A.\u00a0Kemnitz, M.\u00a0Marangio, G.\u00a0Karafov\u00e1). His experiences with distance graphs (which he studied already during his postgraduate studies) were later used in the study of long circles in these graphs (co-authors D.\u00a0Rautenbach and C.\u00a0L\u00f6wenstein). Until now, he has supervised four PhD. students.<\/p>\n
RNDr. Fabrici is student of prof. Jendro\u013e and prof. Hansjoachim Walther (TU Ilmenau, Germany). The topics of his research are mainly local structural properties (the existence of light subgraphs) of planar and k-planar graphs, colourings of plane graphs and long cycles in graphs. He proved valuable results on facially-constrained colourings of plane graphs (co-authors F.\u00a0G\u00f6ring, S.\u00a0Jendro\u013e, M.\u00a0Voigt, M.\u00a0Vrbjarov\u00e1). Valuable are also his recent findings on the longest cycles in essentially 4-connected plane graphs (co-authors J.\u00a0Harant, S.\u00a0Jendro\u013e, S.\u00a0Mohr, J.\u00a0M.\u00a0Schmidt). As a co-supervisor, he participated in the supervision of one PhD. student.<\/p>\n
RNDr. M\u00e1ria Macekov\u00e1, PhD. represents the youngest generation in KOSDIM. Her scientific work was successfully started under the guidance of her PhD. supervisor prof. Jendro\u013e. She obtained knowledge of structure of short paths in sparse plane graphs (co-authors S.\u00a0Jendro\u013e, M.\u00a0Montassier, R.\u00a0Sot\u00e1k), which were almost immediately cited.<\/p>\n","protected":false},"excerpt":{"rendered":"