Zobrazeno 1 - 10
of 2 631
pro vyhledávání: '"Fürst M"'
Autor:
Fürst, M., Rautenbach, D.
For a matching $M$ in a graph $G$, let $G(M)$ be the subgraph of $G$ induced by the vertices of $G$ that are incident with an edge in $M$. The matching $M$ is induced, if $G(M)$ is $1$-regular, and $M$ is uniquely restricted, if $M$ is the unique per
Externí odkaz:
http://arxiv.org/abs/1807.08981
Autor:
Fürst, M., Rautenbach, D.
A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. We establish tight lower bounds on the maximum size of a uniquely restricted matching in terms of order, size, and maximum degree.
Externí odkaz:
http://arxiv.org/abs/1803.11032
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 either a cograph, or a split graph, or an interval graph, or claw-free. Fur
Externí odkaz:
http://arxiv.org/abs/1712.04228
Autor:
Fürst, M., Rautenbach, D.
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 incident to an edge in $M$ is a forest. We show that the acyclic matchi
Externí odkaz:
http://arxiv.org/abs/1710.10076
Autor:
Fürst, M., Rautenbach, D.
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 size of a matching of each of these types, whether some given graph has a
Externí odkaz:
http://arxiv.org/abs/1710.08236
Autor:
Fürst, M., Rautenbach, D.
We provide a short proof of a conjecture of Davila and Kenter concerning a lower bound on the zero forcing number $Z(G)$ of a graph $G$. More specifically, we show that $Z(G)\geq (g-2)(\delta-2)+2$ for every graph $G$ of girth $g$ at least $3$ and mi
Externí odkaz:
http://arxiv.org/abs/1705.08365
For an integer $k$ at least $2$, and a graph $G$, let $f_k(G)$ be the minimum cardinality of a set $X$ of vertices of $G$ such that $G-X$ has either $k$ vertices of maximum degree or order less than $k$. Caro and Yuster (Discrete Mathematics 310 (201
Externí odkaz:
http://arxiv.org/abs/1705.07409
Autor:
Bertolino, A., Fürst, M., Stagni, A., Frassoldati, A., Pelucchi, M., Cavallotti, C., Faravelli, T., Parente, A.
Publikováno v:
In Combustion and Flame July 2021 229
Publikováno v:
Osteuropa, 1926 Apr 01. 1(7), 440-440.
Externí odkaz:
https://www.jstor.org/stable/44927538
Autor:
Andreae, Friedrich
Publikováno v:
Jahrbücher für Kultur und Geschichte der Slaven, 1925 Jan 01. 1(2), 264-266.
Externí odkaz:
https://www.jstor.org/stable/45420285