Matching covers of cubic graphs
Thesis title in Czech: | Pokrývání kubických grafů párováními |
---|---|
Thesis title in English: | Matching covers of cubic graphs |
Key words: | kubické grafy, perfektní párování, Berge-Fulkersonova hypotéza, treelike snarky |
English key words: | cubic graphs, perfect matching, Berge-Fulkerson conjecture, treelike snarks |
Academic year of topic announcement: | 2016/2017 |
Thesis type: | diploma thesis |
Thesis language: | angličtina |
Department: | Computer Science Institute of Charles University (32-IUUK) |
Supervisor: | doc. Mgr. Robert Šámal, Ph.D. |
Author: | hidden - assigned and confirmed by the Study Dept. |
Date of registration: | 24.04.2017 |
Date of assignment: | 28.04.2017 |
Confirmed by Study dept. on: | 04.05.2017 |
Date and time of defence: | 07.06.2017 09:00 |
Date of electronic submission: | 15.05.2017 |
Date of submission of printed version: | 12.05.2017 |
Date of proceeded defence: | 07.06.2017 |
Opponents: | RNDr. Edita Rollová, Ph.D. |
Guidelines |
Student will learn about current state of conjectures about covering (cubic) graphs by (perfect) matchings, mainly Berge-Fulkerson conjecture and its variants. She will study these conjectures on particular classes of (cubic) graphs, in particular on treelike snarks defined by Abreu et al. |
References |
C.Q. Zhang: Integer Flows and Cycle Covers of Graphs, CRC Press, 1997.
C.Q. Zhang: Circuit Double Cover of Graphs, Cambridge University Press, 2012. M. Abreu, T. Kaiser, D. Labbate, G. Mazzuoccolo: Treelike snarks, arXiv:1601.00870 current literature based on adviser's recommendation |