Bc. Tai Phat Pham
Bachelor's thesis
On k-thin and thin-strip graph classes
On k-thin and thin-strip graph classes
Abstract:
Tzv. interval grafy jsou známou podtřídou tzv. intersection grafů, které byly podrobně studovány. Jednou z nejznámějších podtříd interval grafů jsou tzv. proper interval grafy. V článku [The stable set problem and the thinness of a graph] C. Mannino a kol. definovali parametr grafů tzv. thinness. Tento parametr byl stanoven na základě některých vlastností interval grafů, přičemž třída grafů, jejichž …moreAbstract:
Interval graphs are a well-known subclass of intersection graphs that have been studied extensively. One of the most well-known subclasses of interval graphs are proper interval graphs. In [The stable set problem and the thinness of a graph], C. Mannino et al. defined a parameter of graphs called thinness. This parameter was established based on some properties of interval graphs, where the class of …more
Language used: English
Date on which the thesis was submitted / produced: 15. 12. 2022
Identifier:
https://is.muni.cz/th/g7mi3/
Thesis defence
- Date of defence: 31. 1. 2023
- Supervisor: prof. RNDr. Petr Hliněný, Ph.D.
- Reader: RNDr. Deniz Agaoglu Cagirici
Full text of thesis
Contents of on-line thesis archive
Published in Theses:- světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatikyMasaryk University
Faculty of InformaticsBachelor programme / field:
Informatics / Informatics
Theses on a related topic
-
Limits of efficient FO model checking of geometric graphs
Filip Pokrývka -
Conflict-free colouring of planar graphs
Lukáš Málik -
Stack number and queue number of graphs
Adam Straka -
Parameterized Algorithms for Geometric Intersection Graphs
Deniz Agaoglu -
A library for drawing directed graphs
Miroslav Demek -
Parameterized Algorithms for Geometric Intersection Graphs
Deniz Agaoglu Cagirici -
Crossing-critical graphs of high vertex degrees
Michal Korbela