Seminar of Graph Theory - Edita Máčajová (29.2.2024)
Thursday 29.2.2024 at 9:50 hod., Lecture room C
Edita Máčajová:
The Petersen graph is the only snark fully covered by short cycles
Abstract:
We prove that the Petersen graph is the only snark (i.e., non-3-edge-colourable connected cubic graph) in which every edge lies in a cycle of length at most five.
This talk is based on a joint work with František Kardoš and Robert Lukoťka.