Thesis topic proposal
András Pluhár
Extremal and algorithmic problems on graphs


Institute: University of Szeged
computer sciences
PhD School in Computer Science

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.

Number of students who can be accepted: 1

Deadline for application: 2017-08-31

All rights reserved © 2007, Hungarian Doctoral Council. Doctoral Council registration number at commissioner for data protection: 02003/0001. Program version: 1.2357 ( 2017. V. 15. )