Zobrazeno 1 - 10
of 1 420
pro vyhledávání: '"Mendoza F."'
Given nonnegative integers, $s$ and $k$, an $(s,k)$-polar partition of a graph $G$ is a partition $(A,B)$ of $V_G$ such that $G[A]$ and $\overline{G[B]}$ are complete multipartite graphs with at most $s$ and $k$ parts, respectively. If $s$ or $k$ is
Externí odkaz:
http://arxiv.org/abs/2303.17055
Publikováno v:
Agronomía Colombiana, Vol 26, Iss 3, Pp 427-434 (2008)
El gusano cogollero Spodoptera frugiperda es una de las plagas que más afectan los cultivos en la región de Sumapaz (Cundinamarca, Colombia). En la actualidad se controla principalmente aplicando productos de síntesis química, sin embargo la apli
Externí odkaz:
https://doaj.org/article/3109b69f98cb4f69b1b1b5482e9459dc
Autor:
Martellucci, R., Menna, M., Mauri, E., Pirro, A., Gerin, R., Paladini de Mendoza, F., Garić, R., Batistić, M., di Biagio, V., Giordano, P., Langone, L., Miserocchi, S., Gallo, A., Notarstefano, G., Savonitto, G., Bussani, A., Pacciaroni, M., Zuppelli, P., Poulain, P.-M.
Publikováno v:
In Journal of Marine Systems September 2024 245
Let $k,l$ be nonnegative integers. A graph $G$ is $(k,l)$-polar if its vertex set admits a partition $(A,B)$ such that $A$ induces a complete multipartite graph with at most $k$ parts, and $B$ induces a disjoint union of at most $l$ cliques with no o
Externí odkaz:
http://arxiv.org/abs/2104.07856
A graph is a cograph if it does not contain a 4-vertex path as an induced subgraph. An $(s, k)$-polar partition of a graph $G$ is a partition $(A, B)$ of its vertex set such that $A$ induces a complete multipartite graph with at most $s$ parts, and $
Externí odkaz:
http://arxiv.org/abs/2104.07852
Autor:
Avila, Y., Scanda, K., Sánchez, L., Mojica, R., Divó-Matos, Y., Mendoza, F., Rodríguez-Hernández, J., Reguera, E.
Publikováno v:
In Inorganica Chimica Acta 1 May 2023 549
Publikováno v:
In Procedia Computer Science 2023 223:184-192
Autor:
Araujo-Pardo, M. Gabriela, Contreras-Mendoza, F. Esteban, Murillo-García, Sara J., Ramos-Tort, Andrea B., Rubio-Montiel, Christian
Publikováno v:
Discrete Applied Mathematics-2019
In this paper, we study the achromatic and the pseudoachromatic numbers of planar and outerplanar graphs as well as planar graphs of girth 4 and graphs embedded on a surface. We give asymptotically tight results and lower bounds for maximal embedded
Externí odkaz:
http://arxiv.org/abs/1706.03109
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Annals of the Missouri Botanical Garden, 2020 Jan 01. 105(2), 145-162.
Externí odkaz:
https://www.jstor.org/stable/27098302