Zobrazeno 1 - 10
of 288
pro vyhledávání: '"Liu, Xujun"'
Autor:
Liu, Xujun, Wang, Yan
A packing $(1^{\ell}, 2^k)$-coloring of a graph $G$ is a partition of $V(G)$ into $\ell$ independent sets and $k$ $2$-independent sets (whose pairwise vertex distance is at least $3$). The famous Four Color Theorem, proved by Appel and Haken as well
Externí odkaz:
http://arxiv.org/abs/2408.12189
For a sequence $S=(s_1, \ldots, s_k)$ of non-decreasing integers, a packing $S$-coloring of a graph $G$ is a partition of its vertex set $V(G)$ into $V_1, \ldots, V_k$ such that for every pair of distinct vertices $u,v \in V_i$, where $1 \le i \le k$
Externí odkaz:
http://arxiv.org/abs/2404.09337
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
The Secretary problem is a classical sequential decision-making question that can be succinctly described as follows: a set of rank-ordered applicants are interviewed sequentially for a single position. Once an applicant is interviewed, an immediate
Externí odkaz:
http://arxiv.org/abs/2303.02361
For a non-decreasing sequence $S = (s_1, \ldots, s_k)$ of positive integers, an $S$-packing edge-coloring of a graph $G$ is a decomposition of edges of $G$ into disjoint sets $E_1, \ldots, E_k$ such that for each $1 \le i \le k$ the distance between
Externí odkaz:
http://arxiv.org/abs/2206.15046
Publikováno v:
In Environmental Research 15 August 2024 255
Publikováno v:
In Journal of Molecular Structure 15 August 2024 1310
Trades, introduced by Hedayat, are two sets of blocks of elements which may be exchanged (traded) without altering the counts of certain subcollections of elements within their constituent blocks. They are of importance in applications where certain
Externí odkaz:
http://arxiv.org/abs/2201.09171
Publikováno v:
J. Appl. Probab. 61 (2024) 578-602
Candidates arrive sequentially for an interview process which results in them being ranked relative to their predecessors. Based on the ranks available at each time, one must develop a decision mechanism that selects or dismisses the current candidat
Externí odkaz:
http://arxiv.org/abs/2107.07513
Autor:
Li, Zuzheng, Guo, Xue, Ma, Ying, Hu, Baoan, Yang, Yanzheng, Tian, Huixia, Liu, Xujun, Meng, Nan, Zhu, Jinyi, Yan, Danni, Song, Hao, Bao, Binqiang, Li, Xuan, Dai, Xuhuan, Zheng, Yi, Jin, Yingshan, Zheng, Hua
Publikováno v:
In Environment International March 2024 185