Zobrazeno 1 - 10
of 450
pro vyhledávání: '"Cruz, César"'
A kernel in a digraph is an independent and absorbent subset of its vertex set. A digraph is critical kernel imperfect if it does not have a kernel, but every proper induced subdigraph does. In this article, we characterize asymmetrical $4$-quasi-tra
Externí odkaz:
http://arxiv.org/abs/2405.01767
Autor:
Fabila-Monroy, Ruy, Gómez-Galicia, Sergio Gerardo, Hernández-Cruz, César, Trujillo-Negrete, Ana Laura
Let $G$ be a graph on $n$ vertices and $1 \le k \le n$ a fixed integer. The $k$-token graph of $G$ is the graph, $F_k(G)$, whose vertex set is equal to all the $k$-subsets of $V(G)$; where two of them are adjacent whenever their symmetric difference
Externí odkaz:
http://arxiv.org/abs/2402.17962
Publikováno v:
Textos & Contextos (Porto Alegre), Vol 17, Iss 1, Pp 228-239 (2018)
Este trabalho, de natureza teórica, tem por objetivo discutir o que perpassa entre a expectativa do cidadão em ter seu direito à saúde garantido, e a prioridade em que o Estado posiciona seu dever de cumprir com o que lhe é devido; tendo como ob
Externí odkaz:
https://doaj.org/article/06e51b23509546c988fca58d0adcb1dc
Publikováno v:
Textos & Contextos (Porto Alegre), Vol 14, Iss 2, Pp 282-290 (2015)
Este ensaio tem por objetivo refletir sobre o papel da formação teórico-política na construção da consciência de classe dos trabalhadores. Partimos da constatação de que a alienação é um processo objetivo, que diariamente produz e reprodu
Externí odkaz:
https://doaj.org/article/495a949da1cf4c8ba5206afe737eb7e6
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:
Discrete Mathematics & Theoretical Computer Science, vol. 26:3, Graph Theory (October 10, 2024) dmtcs:11479
A graph $G$ is said to be an $(s, k)$-polar graph if its vertex set admits a partition $(A, B)$ such that $A$ and $B$ induce, respectively, a complete $s$-partite graph and the disjoint union of at most $k$ complete graphs. Polar graphs and monopolar
Externí odkaz:
http://arxiv.org/abs/2210.02497
Publikováno v:
In Applied Mathematics and Computation 1 November 2024 480
Publikováno v:
In Microbiological Research March 2025 292
It is known that every hereditary property can be characterized by finitely many minimal obstructions when restricted to either the class of cographs or the class of $P_4$-reducible graphs. In this work, we prove that also when restricted to the clas
Externí odkaz:
http://arxiv.org/abs/2203.04953
Autor:
de Mendonça Cruz, César Albenes1 cesar.cruz@emescam.br, Ferreira de Andrade, Janice Gusmão2 janice.andrade@emescam.br, Gabriel Arpini, Carlos3 carlos.arpini@edu.emescam.br, de Lima Soares, Ricardo4 ricardoservicosocial@gmail.com
Publikováno v:
Em Pauta. 2024 Special Issue, Vol. 22, p107-118. 12p.