Universität Ulm

output

19942026

most citedArea laws for the entanglement entropy - a review

2.9k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing 2017 · math.COShow all

7 papers · 2 filters

math.CO2017

On some Graphs with a Unique Perfect Matching

S. Chaplick, M. Fürst, F. Maffray +1

We show that deciding whether a given graph $G$ of size $m$ has a unique perfect matching as well as finding that matching, if it exists, can be done in time $O (m)$ if $G$ is eithe…

math.CO2017★ 2 cited

A lower bound on the acyclic matching number of subcubic graphs

M. Fürst, D. Rautenbach

The acyclic matching number of a graph $G$ is the largest size of an acyclic matching in $G$ , that is, a matching $M$ in $G$ such that the subgraph of $G$ induced by the vertices i…

math.CO2017★ 3 cited

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…

math.CO2017

On the Kőnig-Egerváry Theorem for $k$ -Paths

Stéphane Bessy, Pascal Ochem, Dieter Rautenbach

The famous Kőnig-Egerváry theorem is equivalent to the statement that the matching number equals the vertex cover number for every induced subgraph of some graph if and only if tha…

math.CO2017

Locally Searching for Large Induced Matchings

Maximilian Fürst, Marilena Leichter, Dieter Rautenbach

It is an easy observation that a natural greedy approach yields a $(d - O (1))$ -factor approximation algorithm for the maximum induced matching problem in $d$ -regular graph…

math.CO2017

Sandwiches Missing Two Ingredients of Order Four

José D. Alvarado, Simone Dantas, Dieter Rautenbach

For a set $F$ of graphs, an instance of the $F$ -{\sc free Sandwich Problem} is a pair $(G_{1}, G_{2})$ consisting of two graphs $G_{1}$ and $G_{2}$ with the same vertex set su…

math.CO2017★ 1 cited

Degenerate Matchings and Edge Colorings

Julien Baste, Dieter Rautenbach

A matching $M$ in a graph $G$ is $r$ -degenerate if the subgraph of $G$ induced by the set of vertices incident with an edge in $M$ is $r$ -degenerate. Goddard, Hedetniemi, Hedetniem…

On some Graphs with a Unique Perfect Matching

A lower bound on the acyclic matching number of subcubic graphs

On some hard and some tractable cases of the maximum acyclic matching problem

On the Kőnig-Egerváry Theorem for k-Paths

Locally Searching for Large Induced Matchings

Sandwiches Missing Two Ingredients of Order Four

Degenerate Matchings and Edge Colorings

On the Kőnig-Egerváry Theorem for $k$ -Paths