4 papers
Cycle decompositions of pathwidth-6 graphs
Elke Fuchs, Laura Gellert, Irene Heinrich
Hajós conjecture asserts that a simple Eulerian graph on n vertices can be decomposed into at most (n - 1)/2 cycles. The conjecture is only proved for graph classes in which every…
On -perfect triangulations of the projective plane
Elke Fuchs, Laura Gellert
We prove that a triangulation of the projective plane is (strongly) -perfect if and only if it is perfect and contains no .
Reducing quadrangulations of the sphere and the projective plane
Elke Fuchs, Laura Gellert
We show that every quadrangulation of the sphere can be transformed into a -cycle by deletions of degree- vertices and by -contractions at degree- vertices. A -contr…
-perfection in -free graphs
Henning Bruhn, Elke Fuchs
A graph is called -perfect if its stable set polytope is fully described by non-negativity, edge and odd-cycle constraints. We characterise -free -perfect graphs in term…