Felix Joos

activity

20132025

most citedOn a rainbow version of Dirac's theorem

47 citations · 178 across the 44 of their papers we have counts for

collaborators

Showing 2014Show all

10 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

Parity linkage and the Erdős-Pósa property of odd cycles through prescribed vertices in highly connected graphs

Felix Joos

We show the following for every sufficiently connected graph $G$ , any vertex subset $S$ of $G$ , and given integer $k$ : there are $k$ disjoint odd cycles in $G$ each containing a ve…

math.CO2014

Induced Matchings in Graphs of Maximum Degree 4

Felix Joos

For a graph $G$ , let $ν_{s} (G)$ be the induced matching number of $G$ . We prove the sharp bound $ν_{s} (G) \geq \frac{n ( G )}{9}$ for every graph $G$ of maximum degree at most $4$ and with…

cs.DM2014

Induced matchings in graphs of degree at most 4

Viet Hang Nguyen

We show that if $G$ is a connected graph of maximum degree at most $4$ , which is not $C_{2, 5}$ , then the strong matching number of $G$ is at least $\frac{1}{9} n (G)$ . This bound is…

math.CO2014★ 2 cited

Induced Matchings in Graphs of Bounded Maximum Degree

Felix Joos

For a graph $G$ , let $ν_{s} (G)$ be the induced matching number of $G$ . We prove that $ν_{s} (G) \geq \frac{n ( G )}{(⌈ \frac{Δ}{2} ⌉ + 1 ) (⌊ \frac{Δ}{2} ⌋ + 1 )}$ for every graph…

math.CO2014

Induced 2-Regular Subgraphs in k-Chordal Cubic Graphs

Michael A. Henning, Felix Joos, Christian Löwenstein +1

We show that a cubic graph $G$ of order $n$ has an induced $2$ -regular subgraph of order at least a) $\frac{n - 2}{4 - \frac{4}{k}}$ , if $G$ has no induced cycle of length more than $k…

math.CO2014★ 2 cited

Induced Cycles in Graphs

Michael A. Henning, Felix Joos, Christian Löwenstein +1

The maximum cardinality of an induced $2$ -regular subgraph of a graph $G$ is denoted by $c_{ind} (G)$ . We prove that if $G$ is an $r$ -regular graph of order $n$ , then $c_{\rm in…

math.CO2014

A Characterization of Substar Graphs

Felix Joos

The intersection graphs of stars in some tree are known as substar graphs. In this paper we give a characterization of substar graphs by the list of minimal forbidden induced subgr…

math.CO2014

Equality of Distance Packing Numbers

Felix Joos, Dieter Rautenbach

We characterize the graphs for which the independence number equals the packing number. As a consequence we obtain simple structural descriptions of the graphs for which (i) the di…

math.CO2014★ 3 cited

Structural parameterizations for boxicity

Henning Bruhn, Morgan Chopin, Felix Joos +1

The boxicity of a graph $G$ is the least integer $d$ such that $G$ has an intersection model of axis-aligned $d$ -dimensional boxes. Boxicity, the problem of deciding whether a give…