| Meno: | Filip
|
|---|
| Priezvisko: | Siviček
|
|---|
| Názov: | Efficient generation of Narboni graphs
|
|---|
| Vedúci: | Mgr. Matúą Matok
|
|---|
| Rok: | 2026
|
|---|
| Kµúčové slová: | cubic, triangulations, Narboni graph, recursive generation, plantri
|
|---|
| Abstrakt: | Narboni graphs are cubic planar cyclically 4-edge-connected graphs without two adjacent faces of size four. They arose during research on semi-2-factor. In this thesis,
we implemented the current knowledge about them into a generator that can generate
them faster than any previous one. We implemented our algorithm as part of plantri - a state of the art program that can generate triangulations and cubic plane graphs.
During our research, we needed to analyse it thoroughly.
|
|---|