Oliver Schaudt

most citedPartitioning two-coloured complete multipartite graphs into monochromatic paths and cycles

2 citations · 2 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2014

Long cycles through prescribed vertices have the Erdős-Pósa property

Henning Bruhn, Felix Joos, Oliver Schaudt

We prove that for every graph, any vertex subset $S$ , and given integers $k, ℓ$ : there are $k$ disjoint cycles of length at least $ℓ$ that each contain at least one vertex fro…

math.CO2014★ 2 cited

Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles

Oliver Schaudt, Maya Stein

We show that any complete $k$ -partite graph $G$ on $n$ vertices, with $k \geq 3$ , whose edges are two-coloured, can be covered with two vertex-disjoint monochromatic paths of distin…