Zobrazeno 1 - 10
of 269
pro vyhledávání: '"Yu Gexin"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 1, Pp 47-62 (2022)
Location detection problems have been studied for a variety of applications including finding faults in multiprocessors, contaminants in public utilities, intruders in buildings and facilities, and for environmental monitoring using wireless sensor n
Externí odkaz:
https://doaj.org/article/c34a9b020f384435a68e88754aab37d7
Autor:
Liu, Xujun, Yu, Gexin
An induced matching in a graph $G$ is a matching such that its end vertices also induce a matching. A $(1^{\ell}, 2^k)$-packing edge-coloring of a graph $G$ is a partition of its edge set into disjoint unions of $\ell$ matchings and $k$ induced match
Externí odkaz:
http://arxiv.org/abs/2402.18353
A digraph $D$ is $k$-linked if for any pair of two disjoint sets $\{x_{1},x_{2},\ldots,x_{k}\}$ and $\{y_{1},y_{2},\ldots,y_{k}\}$ of vertices in $D$, there exist vertex disjoint dipaths $P_{1},P_{2},\ldots,P_{k}$ such that $P_{i}$ is a dipath from $
Externí odkaz:
http://arxiv.org/abs/2311.04068
Autor:
Cranston, Daniel W., Yu, Gexin
Publikováno v:
Journal of Graph Theory. Vol. 107(3). July 2024. pp. 559-577
Hocquard, Kim, and Pierron constructed, for every even integer $D\ge 2$, a 2-degenerate graph $G_D$ with maximum degree $D$ such that $\omega(G_D^2)=\frac52D$. We prove for (a) all 2-degenerate graphs $G$ and (b) all graphs $G$ with $\mbox{mad}(G)<4$
Externí odkaz:
http://arxiv.org/abs/2305.11763
Chv\'atal in 1973 introduced the concept of graph toughness and initiated the study of sufficient toughness conditions for the existence of hamiltonian cycles in graphs. Over the years, numerous results related to graph toughness have been proved. No
Externí odkaz:
http://arxiv.org/abs/2304.14172
Autor:
Yu, Gexin, Yu, Rachel
A strong edge-coloring of a graph $G$ is an edge-coloring in which every color class is an induced matching, and the strong chromatic index $\chi_s'(G)$ is the minimum number of colors needed in strong edge-colorings of $G$. A graph is $2$-degenerate
Externí odkaz:
http://arxiv.org/abs/2301.12924
Publikováno v:
Discrete Mathematics,2023
An edge (vertex) cut $X$ of $G$ is $r$-essential if $G-X$ has two components each of which has at least $r$ edges. A graph $G$ is $r$-essentially $k$-edge-connected (resp. $k$-connected) if it has no $r$-essential edge (resp. vertex) cuts of size les
Externí odkaz:
http://arxiv.org/abs/2208.12922
An odd coloring of a graph $G$ is a proper coloring such that any non-isolated vertex in $G$ has a coloring appears odd times on its neighbors. The odd chromatic number, denoted by $\chi_o(G)$, is the minimum number of colors that admits an odd color
Externí odkaz:
http://arxiv.org/abs/2206.13967
The 2-dimensional global rigidity has been shown to be equivalent to 3-connectedness and redundant rigidity by a combination of two results due to Jackson and Jord\'an, and Connelly, respectively. By the characterization, a theorem of Lov\'asz and Ye
Externí odkaz:
http://arxiv.org/abs/2106.08539
Autor:
Liu, Runrun, Yu, Gexin
Publikováno v:
Discrete Applied Mathematics, 284 (2020), 626-630
A graph is {\em near-bipartite} if its vertex set can be partitioned into an independent set and a set that induces a forest. It is clear that near-bipartite graphs are $3$-colorable. In this note, we show that planar graphs without cycles of lengths
Externí odkaz:
http://arxiv.org/abs/2106.00159