Crossing-critical graphs of high vertex degrees – Bc. Michal Korbela
Bc. Michal Korbela
Master's thesis
Crossing-critical graphs of high vertex degrees
Crossing-critical graphs of high vertex degrees
Abstract:
Nedávny výsledok Bokala a kol. konečne zodpovedal otázku ohľadom maximálneho stupňa vrcholov v c-crossing-critical grafoch. Pre každú hodnotu c<=12 existuje konštanta Dc taká, že každý c-crossing-critical graf má stupeň vrcholu nanajvýš Dc a pre každé c>=13 poskytli induktívnu konštrukciu c-crossing-critical grafov s ľubovolne vysokými stupňami vrcholov. Kým induktívna časť konštrukcie je viac …moreAbstract:
A recent result of Bokal et al. finally gave an answer to the question of maximum vertex degrees in c-crossing-critical graphs. For each c ≤ 12, there exists a constant D c such that every c-crossing-critical graph has vertex degrees at most D c and for each c ≥ 13, they provided an inductive construction of c-crossing-critical graphs with arbitrarily high vertex degrees. While the inductive part of …more
Language used: English
Date on which the thesis was submitted / produced: 18. 5. 2021
Identifier:
https://is.muni.cz/th/sd44n/
Thesis defence
- Date of defence: 21. 6. 2021
- Supervisor: prof. RNDr. Petr Hliněný, Ph.D.
- Reader: PhD Ander Lamaison Vidarte
Citation record
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 InformaticsMaster programme / field:
Informatics / Theoretical Informatics
Theses on a related topic
-
Průsečíková čísla grafů
Marek Derňár -
A library for drawing directed graphs
Miroslav Demek