1.2k citations
- Center for Integrated Quantum Science and TechnologyDE56 papers
- Centre National de la Recherche ScientifiqueFR19 papers
- Helmholtz-Institute UlmDE14 papers
- Imperial College LondonGB13 papers
- Leibniz University HannoverDE13 papers
- Hebrew University of JerusalemIL12 papers
- Technische Hochschule UlmDE11 papers
- National University of SingaporeSG10 papers
- Universitat Autònoma de BarcelonaES10 papers
- Technical University of MunichDE9 papers
- University of MilanIT9 papers
- Centre for Quantum TechnologiesSG8 papers
22 papers · 1 filter
Even -cycles have the edge-Erdős-Pósa property
Henning Bruhn
I prove that even -cycles have the edge-Erdős-Pósa property.
Long --paths have the edge-Erd\H os-Pósa property
Matthias Heinlein, Arthur Ulmer
For a fixed integer a path is long if its length is at least . We prove that for all integers and there is a number such that for every graph $G…
On the hardness of deciding the equality of the induced and the uniquely restricted matching number
Maximilian Fürst
If denotes the subgraph of a graph induced by the set of vertices that are covered by some matching in , then is an induced or a uniquely restricted matching…
On some Graphs with a Unique Perfect Matching
S. Chaplick, M. Fürst, F. Maffray +1
We show that deciding whether a given graph of size has a unique perfect matching as well as finding that matching, if it exists, can be done in time if is eithe…
A lower bound on the acyclic matching number of subcubic graphs
M. Fürst, D. Rautenbach
The acyclic matching number of a graph is the largest size of an acyclic matching in , that is, a matching in such that the subgraph of induced by the vertices i…
On some hard and some tractable cases of the maximum acyclic matching problem
M. Fürst, D. Rautenbach
Three well-studied types of subgraph-restricted matchings are induced matchings, uniquely restricted matchings, and acyclic matchings. While it is hard to determine the maximum siz…