Showing 2017Show all
2 papers · 1 filter
math.CO2017
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…
math.CO2017
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 .