Meike Hatzel
2 indexed papers
Publications per year
Top categories
Frequent co-authors
Research Timeline
This paper shows that for every graph, there exist a certain number of vertex-disjoint cycles of different lengths, or a smaller set of vertices such that the graph without these vertices has fewer cycle lengths. Similar results are proven for facial lengths of embedded graphs. The paper also shows that subdivided ladders have only a small number of cycle lengths.
The paper presents an alternative version of the directed flat wall theorem, improving upon existing ones by excluding a different digraph as a butterfly minor.