Thesis/Dissertation: Michal Korbela: Degree properties of 2-crossing-critical graphs
Bachelor's thesis
Degree properties of 2-crossing-critical graphs
Abstract
Naším cieľom je detailne analyzovať vlastnosti vrcholov 2-crossing-critical grafov. Na to použijeme výsledok od Bokala, Oporowského, Richtera a Salazara, ktorí úplne popísali všetky 2-crossing-critical grafy až na konečné množstvo výnimiek. Ich výsledok hovorí najmä o tom, že stupne vrcholov týchto grafov môžu byť len 3,4,5 a 6. Konštrukcie nekonečných rodín 2-crossing-critical grafov s konkrétnym …more
Abstract
Our goal is to provide a fine detailed analysis of degree properties of 2-crossing-critical graphs. We use a deep result of Bokal, Oporowski, Richter and Salazar completely describing all 2-crossing-critical graphs up to finitely many exceptions. In particular, their description implies that only vertex degrees 3,4,5 and 6 can occur in those graphs. There are known constructions of infinite families …more
Thesis description
29/5/2018 08:27, prof. RNDr. Petr Hliněný, Ph.D., UČO 168881
Theses on a related topic
List of theses with an identical keyword.
-
Graph crossing numbers
Mgr. Marek Derňár -
Discrete methods in computer science
Jacob Cooper, Ph.D. -
Graphics in the CAS system Maxima
Mgr. Mikuláš Múdry, UČO 394225 -
Priority Queues
Bc. Marek Chocholáček -
Efficient route-planning in huge graphs
RNDr. Ondrej Moriš, UČO 172887 -
Non traditional exercises using in secondary school
Mgr. et Mgr. Jana Doleželová -
Link analysis
Mgr. Marek Nesiba -
Tree-depth of grids
Bc. Štěpán Mikéska




