Zobrazeno 1 - 10
of 66
pro vyhledávání: '"Ruy Fabila-Monroy"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 24, no. 1, Iss Graph Theory (2022)
Let $k$ and $n$ be integers such that $1\leq k \leq n-1$, and let $G$ be a simple graph of order $n$. The $k$-token graph $F_k(G)$ of $G$ is the graph whose vertices are the $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$ whenever
Externí odkaz:
https://doaj.org/article/5036cb03dd244ab6ba69d9cfefa80098
Publikováno v:
Tapuya, Vol 4, Iss 1 (2021)
Immunology publications by Latin American countries were analyzed for the period 2000–2017. The region showed a constant growth in article production during this time. The increase was mainly due to articles in Q1 and Q2 journals. The more producti
Externí odkaz:
https://doaj.org/article/0b41528c1cd545ceaf7e435a86b9ddef
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 22 no. 1, Iss Graph Theory (2020)
Let $P$ be a set of $n\geq 4$ points in general position in the plane. Consider all the closed straight line segments with both endpoints in $P$. Suppose that these segments are colored with the rule that disjoint segments receive different colors. I
Externí odkaz:
https://doaj.org/article/c102e2cd366b4f738337ce03252b2655
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 16 no. 3, Iss Combinatorics (2014)
Combinatorics
Externí odkaz:
https://doaj.org/article/e6b9ca513fbf4f1eb3e70e38a405e840
Autor:
Crevel Bautista-Santiago, Javier Cano, Ruy Fabila-Monroy, David Flores-Peñaloza, Hernàn González-Aguilar, Dolores Lara, Eliseo Sarmiento, Jorge Urrutia
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 15 no. 3, Iss Combinatorics (2013)
Combinatorics
Externí odkaz:
https://doaj.org/article/c046a418cb3a4b92b10e77bce864c81a
Autor:
Luis Barba, Ruy Fabila-Monroy, Dolores Lara, Jesús Leaños, Cynthia Rodrıguez, Gelasio Salazar, Francisco Zaragoza
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 15 no. 1, Iss Combinatorics (2013)
Combinatorics
Externí odkaz:
https://doaj.org/article/f581cd740ca942e8a44974f8ad5c70b9
Autor:
Ruy Fabila-Monroy, David R. Wood
Publikováno v:
Journal of Computational Geometry, Vol 3, Iss 1 (2012)
Let P be a set of n points in general position in the plane. We study the chromatic number of the intersection graph of the open triangles determined by P. It is known that this chromatic number is at least n3/27+O(n2) and, if P is in convex position
Externí odkaz:
https://doaj.org/article/08a98f1d2cc74c57bb8328a4e36ab90e
Autor:
Oswin Aichholzer, Sergio Cabello, Ruy Fabila-Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Ferran Hurtado, David R. Wood
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 12 no. 1, Iss Graph and Algorithms (2010)
Graphs and Algorithms
Externí odkaz:
https://doaj.org/article/bced14a406bb406ea2d51d7796ac040b
Autor:
Ruy Fabila-Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, Jorge Urrutia, David R. Wood
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 11 no. 2, Iss Graph and Algorithms (2009)
Graphs and Algorithms
Externí odkaz:
https://doaj.org/article/bf84775a29334727950f6517dd396af7
Publikováno v:
Acta Mathematica Hungarica. 165:28-39
An edge-ordered graph is a graph with a total ordering of its edges. A path $$P=v_1v_2\ldots v_k$$ in an edge-ordered graph is called increasing if $$(v_iv_{i+1}) < (v_{i+1}v_{i+2})$$ for all $$i = 1,\ldots,k-2$$ ; and it is called decreasing if $$(v