ODT - THESIS TOPIC: András Pluhár: Extremal and algorithmic problems ...


	Login Forum Organisation officers member institutions resolutions (in Hung.) by-laws (in Hung.) regulations Doctoral program doctoral schools by institution by research field by number ceased working academic staff member by name by research topic archives thesis topic proposals by doctoral school by research field by research topic supervision of PhD students search students Theses defended by institution by research field by name by date by doctoral school Naturalized degrees by institution by research field by name by date Habilitation presentations by institution by branch of science by name Documents (all in Hung.) public documents news legal backgrounds guidelines Contacts contact details partners

Thesis topic proposal

Extremal and algorithmic problems on graphs

THESIS TOPIC PROPOSAL

Institute: University of Szeged
computer sciences
Doctoral School of 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: 2022-03-15

2024. IV. 17.
ODT ülés
Az ODT következő ülésére 2024. június 14-én, pénteken 10.00 órakor kerül sor a Semmelweis Egyetem Szenátusi termében (Bp. Üllői út 26. I. emelet).