2 citations · 2 across the 3 of their papers we have counts for
3 papers
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 , and given integers : there are disjoint cycles of length at least that each contain at least one vertex fro…
cs.CC2014
Squares of -sun-free split graphs
Van Bang Le, Andrea Oversberg, Oliver Schaudt
The square of a graph , denoted by , is obtained from by putting an edge between two distinct vertices whenever their distance is two. Then is called a square root…
math.CO2014★ 2 cited
Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles
Oliver Schaudt, Maya Stein
We show that any complete -partite graph on vertices, with , whose edges are two-coloured, can be covered with two vertex-disjoint monochromatic paths of distin…