Zobrazeno 1 - 10
of 272
pro vyhledávání: '"Mészáros, Gábor"'
Autor:
Mészárosová, Mária1 (AUTHOR), Mészáros, Gábor2 (AUTHOR), Moravčíková, Nina1 (AUTHOR) nina.moravcikova@uniag.sk, Pavlík, Ivan3 (AUTHOR), Margetín, Milan1 (AUTHOR), Kasarda, Radovan1 (AUTHOR)
Publikováno v:
Archives Animal Breeding / Archiv Tierzucht. 2024, Vol. 67 Issue 3, p373-381. 9p.
Autor:
Girão, António, Mészáros, Gábor
A graph $G$ is terminal-pairable with respect to a demand multigraph $D$ on the same vertex set as $G$, if there exists edge-disjoint paths joining the end vertices of every demand edge of $D$. In this short note, we improve the upper bound on the la
Externí odkaz:
http://arxiv.org/abs/1708.06837
A graph is path-pairable if for any pairing of its vertices there exist edge disjoint paths joining the vertices in each pair. We obtain sharp bounds on the maximum possible diameter of path-pairable graphs which either have a given number of edges,
Externí odkaz:
http://arxiv.org/abs/1707.04247
A graph is path-pairable if for any pairing of its vertices there exist edge-disjoint paths joining the vertices in each pair. We investigate the behaviour of the maximum degree in path-pairable planar graphs. We show that any $n$-vertex path-pairabl
Externí odkaz:
http://arxiv.org/abs/1705.06068
Autor:
Rienesl, Lisa, Fuerst‐Waltl, Birgit, Mészáros, Gábor, Koeck, Astrid, Egger‐Danner, Christa, Gengler, Nicolas, Grelet, Clément, Sölkner, Johann
Publikováno v:
Journal of Animal Breeding & Genetics; Nov2024, Vol. 141 Issue 6, p614-627, 14p
Autor:
Baldan, Sergelen, Sölkner, Johann, Gebre, Kahsa Tadel, Mészáros, Gábor, Crooijmans, Richard, Periasamy, Kathiravan, Pichler, Rudolf, Manaljav, Bayarjargal, Baatar, Narantuya, Purevdorj, Myagmarsuren
Publikováno v:
Frontiers in Genetics; 10/1/2024, p1-17, 17p
Publikováno v:
In Journal of Electroanalytical Chemistry 15 October 2021 899
Gentner and Rautenbach conjectured that the size of a minimum zero forcing set in a connected graph on $n$ vertices with maximum degree $3$ is at most $\frac{1}{3}n+2$. We disprove this conjecture by constructing a collection of connected graphs $\{G
Externí odkaz:
http://arxiv.org/abs/1611.07513
We study combinatorial parameters of a recently introduced bootstrap percolation problem in finite projective planes. We present sharp results on the size of the minimum percolating sets and the maximal non-percolating sets. Additional results on the
Externí odkaz:
http://arxiv.org/abs/1608.00531
Publikováno v:
Discrete Mathematics Volume 340, Issue 5, May 2017, Pages 988-990
We affirmatively answer and generalize the question of Kubicka, Kubicki and Lehel concerning the path-pairability of high-dimensional complete grid graphs. As an intriguing by-product of our result we significantly improve the estimate of the necessa
Externí odkaz:
http://arxiv.org/abs/1606.06826