Thesis supervisor: András Pluhár
Location of studies (in Hungarian): SZTE Abbreviation of location of studies: SZTE
Description of the research topic:
The representability of graphs by intervals includes many open problems (there are only partial results for the intervallum number of comparability graphs or dense graphs). Several partion problem for planar graphs are also unsolved. On the other hand, good reprezentations can give ways to the computation of bandwidth, and the investigation of chromatic number on special graphs, such as the connection of P_k-free graphs and 3-colorability.