Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Marcelo H. de Carvalho"'
Autor:
Francely M. Fernandes, David M. Lapola, Rodrigo Neregato, Marcelo H. de Carvalho, Claudio J. Von Zuben
Publikováno v:
Iheringia: Série Zoologia, Vol 93, Iss 3, Pp 319-324 (2003)
Lucilia cuprina (Wiedemann, 1830) is a cosmopolite blowfly species of medical and veterinary importance because it produces myiasis, mainly in ovine. In order to evaluate the demographic characteristics of this species, survivorship curves for 327 ad
Externí odkaz:
https://doaj.org/article/0200bea75a97429bb1267a77faf265e4
Autor:
Yixun Lin, G. Sanjith, Cláudio Leonardo Lucchesi, Marcelo H. de Carvalho, Xiumei Wang, Charles H. C. Little
Publikováno v:
Discrete Mathematics. 313:772-783
The perfect-matching polytope of a graph G is the convex hull of the incidence vectors of all perfect matchings in G. This paper characterizes bipartite and nearly bipartite graphs whose 1-skeleton graphs of perfect-matching polytopes have diameter 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a956ed9499414ff50242ed0e86c960a3
https://doi.org/10.1016/j.disc.2012.12.015
https://doi.org/10.1016/j.disc.2012.12.015
Publikováno v:
SIAM Journal on Discrete Mathematics. 27:940-958
In this paper we show that, with 11 exceptions, any matching covered bipartite graph on $n$ vertices, with minimum degree greater than two, has at least $2n-4$ perfect matchings. Using this bound, which is the best possible, and McCuaig's theorem [W.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9e703614a9265d0176115c1bd3a4167a
https://doi.org/10.1137/120865938
https://doi.org/10.1137/120865938
Publikováno v:
Journal of Combinatorial Theory, Series B. 102:1241-1266
Little (1975) [12] showed that, in a certain sense, the only minimal non-Pfaffian bipartite matching covered graph is the brace K"3","3. Using a stronger notion of minimality than the one used by Little, we show that every minimal non-Pfaffian brick
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9dd6c1a18e2f4b7f01fe87575622e4e3
https://doi.org/10.1016/j.jctb.2012.07.004
https://doi.org/10.1016/j.jctb.2012.07.004
Publikováno v:
Journal of Graph Theory. 62:220-233
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::733da644bce44835793a2f10509006d2
https://doi.org/10.1002/jgt.20400
https://doi.org/10.1002/jgt.20400
Publikováno v:
The Electronic Journal of Combinatorics. 22
The bicontraction of a vertex $v$ of degree two in a graph, with precisely two neighbours $v_1$ and $v_2$, consists of shrinking the set $\{v_1,v,v_2\}$ to a single vertex. The retract of a matching covered graph $G$, denoted by $\widehat{G}$, is the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::525a31c40d58a96b50439445f798d52f
https://doi.org/10.37236/4141
https://doi.org/10.37236/4141
Publikováno v:
ACM Transactions on Algorithms. 1:324-337
Our main result is an O(nm) -time (deterministic) algorithm for constructing an ear decomposition of a matching-covered graph, where n and m denote the number of nodes and edges. The improvement in the running time comes from new structural results t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d9d64aee91f867a78d6ee4211d43f13
https://doi.org/10.1145/1103963.1103969
https://doi.org/10.1145/1103963.1103969
Publikováno v:
RAIRO - Theoretical Informatics and Applications. 39:93-113
A subgraph H of a graph G is conformal if G - V(H) has a perfect matching. An orientation D of G is Pfaffian if, for every conformal even circuit C , the number of edges of C whose directions in D agree with any prescribed sense of orientation of C i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76d715c8a3cbeb8b2b3c0698d9e5519a
https://doi.org/10.1051/ita:2005005
https://doi.org/10.1051/ita:2005005
Publikováno v:
Journal of Graph Theory. 48:19-50
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3bd4f23c1110dd90e79a4a4447957bad
https://doi.org/10.1002/jgt.20036
https://doi.org/10.1002/jgt.20036
Publikováno v:
Journal of Combinatorial Theory, Series B. 85:94-136
In 1987, Lovasz conjectured that every brick G different from K4, C6, and the Petersen graph has an edge e such that G?e is a matching covered graph with exactly one brick. Lovasz and Vempala announced a proof of this conjecture in 1994. Their paper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a410f77b4e6d148d314226905431de80
https://doi.org/10.1006/jctb.2001.2091
https://doi.org/10.1006/jctb.2001.2091