Bc. Jan Jedelský
Bachelor's thesis
Classes of bounded and unbounded twin-width
Classes of bounded and unbounded twin-width
Abstract:
V této práci vytvoříme shrnutí twin-width se zaměřením na kritéria pro určení, zda-li má daná třída grafů shora omezenou twin-width. Dále shrneme třídy grafů, u nichž je známo, zda je jejich twin-width omezená či nikoliv. Poté studujeme twin-width průnikových grafů a ukážeme, že třída vlastních průnikových grafů cest ve stromech a třída vlastních H-grafů, kde H není cyklus ani cesta, nemají shora omezenou …moreAbstract:
In this thesis, we give an overview of twin-width, focusing on criteria for determining whenever a class of graphs has bounded twin-width. Furthermore, we summarize known classes of graphs with bounded and unbounded twin-width. Afterward, we study the twin-width of intersection graphs and show that the class of proper intersection graphs of paths in trees and the class of proper H-graphs, where H is …more
Language used: English
Date on which the thesis was submitted / produced: 25. 5. 2021
Identifier:
https://is.muni.cz/th/utyga/
Thesis defence
- Date of defence: 28. 6. 2021
- Supervisor: prof. RNDr. Petr Hliněný, Ph.D.
- Reader: PhD Frederik Garbe
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 / Mathematical Informatics
Theses on a related topic
-
On k-thin and thin-strip graph classes
Tai Phat Pham -
Structural and geometric graph theory and algorithmic metatheorems
Filip Pokrývka