| Meno: | Bohdan |
|---|---|
| Priezvisko: | Jóľa |
| Názov: | Edge colouring of signed cubic graphs |
| Vedúci: | doc. RNDr. Robert Luko»ka, PhD. |
| Rok: | 2025 |
| Kµúčové slová: | signed graph, cubic graph, signed edge coloring, snark, vertex switching, switching isomorphism, generating graphs, non-equivalent graphs |
| Abstrakt: | Signed graphs were defined by Frank Harary in year 1953 as a model for studying social networks. The problem of signed colouring, however, was not explored until 1982 when Thomas Zaslavsky published his first results. Vertex switching creates equivalence classes on signed graphs. In this thesis we present an algorithm for generating non-equivalent signed graphs under switching isomorphism and an algorithm to determine the chromatic index of a signed graph. Combining these algorithms allows us to generate small non-3-edge-colourable cubic signed graphs and make the systematic research in this topic easier. |
Súbory diplomovej práce:
| joza_final.pdf |
Súbory prezentácie na obhajobe: