Probability and Mathematical StatisticsY Mgr. Markéta Zikmundová, PhD. 

Discrete MathematicsY Jana Maxová Our research group is mainly engaged in exploring open problems in combinatorics, discrete mathematics and graph theory in particular. In recent years, our group has dealt with classical topics of graph theory, such as various types of graph coloring (e.g. star coloring of bipartite graphs), applications of linear algebra in graph theory, graph minors, computational complexity of graph algorithms etc. Recently, our research focuses especially on the investigation of socalled coverincomparability graphs (or shortly CI graphs). These are recently defined graphs derived from a partially ordered sets such that two vertices are connected by an edge, if and only if these two points are either incomparable or one covers the other in the original ordered set. In this area, we have published several articles in journals that dealt with the recognition complexity and the structure of this newly defined class of graphs. 

Dynamical SystemsY Prof. RNDr. Drahoslava Janovská, CSc. → web 
iduzel: 24737
idvazba: 31144
šablona: stranka
čas: 1.4.2020 16:08:12
verze: 4653
uzivatel:
remoteAPIs:
branch: trunk
Obnovit  RAW
idvazba: 31144
šablona: stranka
čas: 1.4.2020 16:08:12
verze: 4653
uzivatel:
remoteAPIs:
branch: trunk
Obnovit  RAW
Applied Mathematics
Updated: 5.1.2016 12:36, Author: fchi