Xiaowei Yu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xiaowei Yu has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Jiaao Li
School of Mathematical Sciences and LPMC Nankai University Tianjin China
2 shared publications - Luis Kuffner
École Normale Supérieure PSL University Paris France
2 shared publications - Lujia Wang
Zhejiang Normal University Jinhua China
2 shared publications - Reza Naserasr
Université Paris Cité, CNRS, IRIF Paris France
2 shared publications - Xiaolan Hu
School of Mathematics and Statistics & Hubei Key Laboratory of Mathematical Sciences Central China Normal University 430079 Wuhan China
2 shared publications Zhouningxin Wang
School of Mathematical Sciences and LPMC Nankai University 300071 Tianjin China
2 shared publications
Latest Publications
- Open Access
Fractional balanced chromatic number of signed subcubic graphs
A signed graph is a pair $(G,σ)$, where $G$ is a graph and $σ: E(G)\rightarrow \{-, +\}$, called signature, is an assignment of signs to the edges. Given a signed graph $(G,σ)$ with no negative loops, a balanced $(p,q)$-coloring of $(G,σ)$ is an assignment $f$ of $q$ colors to each vertex from a pool of $p$ colors such that each color class induces a balanced subgraph, i.e., no negative cycles. Let $(K_4,-)$ be the signed graph on $K_4$ with all edges being negative. In this work, we show that every signed (simple) subcubic graph admits a balanced $(5,3)$-coloring except for $(K_4,-)$ and signed graphs switching equivalent to it. For this particular signed graph the best balanced colorings are $(2p,p)$-colorings.Open AccessFractional balanced chromatic number of signed subcubic graphs
A signed graph is a pair $(G,σ)$, where $G$ is a graph and $σ: E(G)\rightarrow \{-, +\}$, called signature, is an assignment of signs to the edges. Given a signed graph $(G,σ)$ with no negative loops, a balanced $(p,q)$-coloring of $(G,σ)$ is an assignment $f$ of $q$ colors to each vertex from a pool of $p$ colors such that each color class induces a balanced subgraph, i.e., no negative cycles. Let $(K_4,-)$ be the signed graph on $K_4$ with all edges being negative. In this work, we show that every signed (simple) subcubic graph admits a balanced $(5,3)$-coloring except for $(K_4,-)$ and signed graphs switching equivalent to it. For this particular signed graph the best balanced colorings are $(2p,p)$-colorings. - Open Access
Fractional balanced chromatic number of signed subcubic graphs
A signed graph is a pair (G, σ), where G is a graph and σ : E(G) → {-, +}, called signature, is an assignment of signs to the edges. Given a signed graph (G, σ) with no negative loops, a balanced (p, q)-coloring of (G, σ) is an assignment f of q colors to each vertex from a pool of p colors such that each color class induces a balanced subgraph, i.e., no negative cycles. Let (K 4 , -) be the signed graph on K 4 with all edges being negative. In this work, we show that every signed (simple) subcubic graph admits a balanced (5, 3)-coloring except for (K 4 , -) and signed graphs switching equivalent to it. For this particular signed graph the best balanced colorings are (2p, p)-colorings.
Open AccessFractional balanced chromatic number of signed subcubic graphs
A signed graph is a pair (G, σ), where G is a graph and σ : E(G) → {-, +}, called signature, is an assignment of signs to the edges. Given a signed graph (G, σ) with no negative loops, a balanced (p, q)-coloring of (G, σ) is an assignment f of q colors to each vertex from a pool of p colors such that each color class induces a balanced subgraph, i.e., no negative cycles. Let (K 4 , -) be the signed graph on K 4 with all edges being negative. In this work, we show that every signed (simple) subcubic graph admits a balanced (5, 3)-coloring except for (K 4 , -) and signed graphs switching equivalent to it. For this particular signed graph the best balanced colorings are (2p, p)-colorings.
- 1 June 2024
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 356, 104-109
An improved upper bound for neighbor sum distinguishing edge colorings of graphs
- 1 June 2024
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 356, 104-109
An improved upper bound for neighbor sum distinguishing edge colorings of graphs
- 27 September 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (1)
On odd colorings of planar graphs
- 27 September 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (1)
On odd colorings of planar graphs
- 28 August 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (1)
Antimagic orientation of forests
- 28 August 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (1)
Antimagic orientation of forests
- 14 December 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 327, 47-59
Antimagic labeling of biregular bipartite graphs
- 14 December 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 327, 47-59
Antimagic labeling of biregular bipartite graphs
- Open Access
- 1 April 2022
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2022, 1-12
Template-Aware Transformer for Person Reidentification
Person reidentification (ReID) is a challenging computer vision task for identifying or verifying one or more persons when the faces are not available. In ReID, the indistinguishable background usually affects the model’s perception of the foreground, which reduces the performance of ReID. Generally, the background of the same camera is similar, whereas that of different cameras is quite different. Based on this finding, we propose a template-aware transformer (TAT) method which can learn intersample indistinguishable features by introducing a learnable template for the transformer structure to cut down the model’s attention to regions of the image with low discrimination, including backgrounds and occlusions. In the multiheaded attention module of the encoder, this template directs template-aware attention to indistinguishable features of the image and gradually increases the attention to distinguishable features as the encoder block deepens. We also increase the number of templates using side information considering the characteristics of ReID tasks to adapt the model to backgrounds that vary significantly with different camera IDs. Finally, we demonstrate the validity of our theories using various public data sets and achieve competitive results via a quantitative evaluation.
- 1 April 2022
- Published by Wiley in Computational Intelligence and Neuroscience
- Vol. 2022, 1-12
Open AccessTemplate-Aware Transformer for Person Reidentification
Person reidentification (ReID) is a challenging computer vision task for identifying or verifying one or more persons when the faces are not available. In ReID, the indistinguishable background usually affects the model’s perception of the foreground, which reduces the performance of ReID. Generally, the background of the same camera is similar, whereas that of different cameras is quite different. Based on this finding, we propose a template-aware transformer (TAT) method which can learn intersample indistinguishable features by introducing a learnable template for the transformer structure to cut down the model’s attention to regions of the image with low discrimination, including backgrounds and occlusions. In the multiheaded attention module of the encoder, this template directs template-aware attention to indistinguishable features of the image and gradually increases the attention to distinguishable features as the encoder block deepens. We also increase the number of templates using side information considering the characteristics of ReID tasks to adapt the model to backgrounds that vary significantly with different camera IDs. Finally, we demonstrate the validity of our theories using various public data sets and achieve competitive results via a quantitative evaluation.
- Open Access
List star edge coloring of generalized Halin graphs
A star $k$-edge coloring is a proper edge coloring such that there are no bichromatic paths or cycles of length four. The smallest integer $k$ such that $G$ admits a star $k$-edge coloring is the star chromatic index of $G$. Deng \etal \cite{MR2933839}, and Bezegov{\'a} \etal \cite{MR3431294} independently proved that the star chromatic index of a tree is at most $\lfloor \frac{3\Delta}{2} \rfloor$, and the bound is sharp. Han \etal \cite{MR3924408} strengthened the result to list version of star chromatic index, and proved that $\lfloor \frac{3\Delta}{2} \rfloor$ is also the sharp upper bound for the list star chromatic index of trees. A generalized Halin graph is a plane graph that consists of a plane embedding of a tree $T$ with $\Delta(T) \geq 3$, and a cycle $C$ connecting all the leaves of the tree such that $C$ is the boundary of the exterior face. In this paper, we prove that if $H := T \cup C$ is a generalized Halin graph with $|C| \neq 5$, then its list star chromatic index is at most \[ \max\left\{\left\lfloor\frac{\theta(T) + \Delta(T)}{2}\right\rfloor, 2 \left\lfloor\frac{\Delta(T)}{2}\right\rfloor + 7\right\}, \] where $\theta(T) = \max_{xy \in E(T)}\{d_{T}(x) + d_{T}(y)\}$. As a consequence, if $H$ is a (generalized) Halin graph with maximum degree $\Delta \geq 13$, then the list star chromatic index is at most $\lfloor \frac{3\Delta}{2} \rfloor$. Moreover, the upper bound for the list star chromatic index is sharp.Open AccessList star edge coloring of generalized Halin graphs
A star $k$-edge coloring is a proper edge coloring such that there are no bichromatic paths or cycles of length four. The smallest integer $k$ such that $G$ admits a star $k$-edge coloring is the star chromatic index of $G$. Deng \etal \cite{MR2933839}, and Bezegov{\'a} \etal \cite{MR3431294} independently proved that the star chromatic index of a tree is at most $\lfloor \frac{3\Delta}{2} \rfloor$, and the bound is sharp. Han \etal \cite{MR3924408} strengthened the result to list version of star chromatic index, and proved that $\lfloor \frac{3\Delta}{2} \rfloor$ is also the sharp upper bound for the list star chromatic index of trees. A generalized Halin graph is a plane graph that consists of a plane embedding of a tree $T$ with $\Delta(T) \geq 3$, and a cycle $C$ connecting all the leaves of the tree such that $C$ is the boundary of the exterior face. In this paper, we prove that if $H := T \cup C$ is a generalized Halin graph with $|C| \neq 5$, then its list star chromatic index is at most \[ \max\left\{\left\lfloor\frac{\theta(T) + \Delta(T)}{2}\right\rfloor, 2 \left\lfloor\frac{\Delta(T)}{2}\right\rfloor + 7\right\}, \] where $\theta(T) = \max_{xy \in E(T)}\{d_{T}(x) + d_{T}(y)\}$. As a consequence, if $H$ is a (generalized) Halin graph with maximum degree $\Delta \geq 13$, then the list star chromatic index is at most $\lfloor \frac{3\Delta}{2} \rfloor$. Moreover, the upper bound for the list star chromatic index is sharp. - Open Access
Improved bounds on the Ramsey number of fans
For a given graph $H$, the Ramsey number $r(H)$ is the minimum $N$ such that any 2-edge-coloring of the complete graph $K_N$ yields a monochromatic copy of $H$. Given a positive integer $n$, a \emph{fan }$F_n$ is a graph formed by $n$ triangles that share one common vertex. We show that ${9n}/{2}-5\le r(F_n)\le {11n}/{2} + 6$ for any $n$. This improves previous best bounds $r(F_n) \le 6n$ of Lin and Li and $r(F_n) \ge 4n+2$ of Zhang, Broersma and Chen.Open AccessImproved bounds on the Ramsey number of fans
For a given graph $H$, the Ramsey number $r(H)$ is the minimum $N$ such that any 2-edge-coloring of the complete graph $K_N$ yields a monochromatic copy of $H$. Given a positive integer $n$, a \emph{fan }$F_n$ is a graph formed by $n$ triangles that share one common vertex. We show that ${9n}/{2}-5\le r(F_n)\le {11n}/{2} + 6$ for any $n$. This improves previous best bounds $r(F_n) \le 6n$ of Lin and Li and $r(F_n) \ge 4n+2$ of Zhang, Broersma and Chen. - 14 March 2019
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 35 (3) , 707-718
Planar Graphs Without 4-Cycles Adjacent to Triangles are DP-4-Colorable
- 14 March 2019
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 35 (3) , 707-718
Planar Graphs Without 4-Cycles Adjacent to Triangles are DP-4-Colorable