Seminár z teórie grafov - Robert Lukoťka (19.10.2017)

vo štvrtok 19.10.2017 o 9:50 hod. v miestnosti M/213

---

Prednášajúci: RNDr. Robert Lukoťka, PhD.

Názov: Short cycle covers in cubic graphs and 5-cycles 

Termín: 19.10.2017, 9:50 hod., M/213

Abstrakt:
A cycle cover of a graph is a collection of cycles such that each edge of the graph is contained in at least one of the cycles. The length of a cycle cover is the sum of all cycle lengths in the cover. We prove that every bridgeless cubic graph on m edges has a cycle cover of total length less than 1.571m. If the graph has no non-trivial 3-edge-cuts, then a cycle cover of total length less than 1.567m exists.

---