23 citations · 110 across the 25 of their papers we have counts for
4 papers · 1 filter
Excluding a Planar Matching Minor in Bipartite Graphs
Archontia C Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht
Matching minors are a specialisation of minors fit for the study of graph with perfect matchings. The notion of matching minors has been used to give a structural description of bi…
A half-integral Erdős-Pósa theorem for directed odd cycles
Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon +1
We prove that there exists a function such that every directed graph contains either directed odd cycles where every vertex of is c…
Matching Connectivity: On the Structure of Graphs with Perfect Matchings
Archontia C. Giannopoulou, Stephan Kreutzer, Sebastian Wiederrecht
We introduce the concept of matching connectivity as a notion of connectivity in graph admitting perfect matchings which heavily relies on the structural properties of those matchi…
Majority Colourings of Digraphs
Stephan Kreutzer, Sang-il Oum, Paul Seymour +2
We prove that every digraph has a vertex 4-colouring such that for each vertex , at most half the out-neighbours of receive the same colour as . We then obtain several re…