Zobrazeno 1 - 10
of 89
pro vyhledávání: '"Leaños, Jesús"'
Let $G=(V(G), E(G))$ be a simple graph with vertex set $V(G)$ and edge set $E(G)$. Let $S$ be a subset of $V(G)$, and let $B(S)$ be the set of neighbours of $S$ in $V(G) \setminus S$. The differential $\partial(S)$ of $S$ is the number $|B(S)|-|S|$.
Externí odkaz:
http://arxiv.org/abs/2308.02564
Let $P$ be a finite set of points in general position in the plane. The disjointness graph of segments $D(P)$ of $P$ is the graph whose vertices are all the closed straight line segments with endpoints in $P$, two of which are adjacent in $D(P)$ if a
Externí odkaz:
http://arxiv.org/abs/2303.17792
Publikováno v:
In Discrete Mathematics March 2024 347(3)
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 24, no. 1, Graph Theory (March 30, 2022) dmtcs:7538
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:
http://arxiv.org/abs/2004.14526
We study $c$-crossing-critical graphs, which are the minimal graphs that require at least $c$ edge-crossings when drawn in the plane. For every fixed pair of integers with $c\ge 13$ and $d\ge 1$, we give first explicit constructions of $c$-crossing-c
Externí odkaz:
http://arxiv.org/abs/1903.05363
Autor:
Caraballo, Luis E., Díaz-Báñez, José-Miguel, Fabila-Monroy, Ruy, Hidalgo-Toscano, Carlos, Leaños, Jesús, Montejano, Amanda
Let $\{p_1,\dots,p_n\}$ and $\{q_1,\dots,q_n\}$ be two sets of $n$ labeled points in general position in the plane. We say that these two point sets have the same order type if for every triple of indices $(i,j,k)$, $p_k$ is above the directed line f
Externí odkaz:
http://arxiv.org/abs/1811.02455
Publikováno v:
In Discrete Applied Mathematics 15 November 2022 321:82-89
Publikováno v:
In Computational Geometry: Theory and Applications June 2022 104
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 22 no. 1, Graph Theory (March 22, 2020) dmtcs:4490
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:
http://arxiv.org/abs/1711.05425
Publikováno v:
Discrete Appl. Math, 247 (2018) 327-340
Neil Sloane showed that the problem of determine the maximum size of a binary code of constant weight 2 that can correct a single adjacent transposition is equivalent to finding the packing number of a certain graph. In this paper we solve this open
Externí odkaz:
http://arxiv.org/abs/1711.03682