Xiaolan Hu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Xiaolan Hu has a total of 50 co-authors. Here are the top co-authors by number of shared publications:
Huiqing Liu
10 shared publications- Huiqing Liu
Faculty of Mathematics and Statistics Hubei Key Laboratory of Applied Mathematics Hubei University 430062 Wuhan China
4 shared publications - Jiaao Li
School of Mathematical Sciences and LPMC Nankai University Tianjin China
4 shared publications - Yaojun Chen
Nanjing University
3 shared publications Yibo Li
3 shared publicationsZhengke Miao
3 shared publications
Latest Publications
- 11 November 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 398, 262-270
Strong fractional coloring of planar graphs without 4-cycles and without 6-cycles adjacent to triangles
- 11 November 2026
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 398, 262-270
Strong fractional coloring of planar graphs without 4-cycles and without 6-cycles adjacent to triangles
- 27 October 2026
- Published by Elsevier in Discrete Mathematics
- Vol. 350 (2)
Fractional coloring of planar graphs with neither triangular 4-cycles nor triangular 5-cycles
- 27 October 2026
- Published by Elsevier in Discrete Mathematics
- Vol. 350 (2)
Fractional coloring of planar graphs with neither triangular 4-cycles nor triangular 5-cycles
- 11 December 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 349 (5)
A neighborhood union condition for the existence of a spanning tree without degree 2 vertices
- 11 December 2025
- Published by Elsevier in Discrete Mathematics
- Vol. 349 (5)
A neighborhood union condition for the existence of a spanning tree without degree 2 vertices
- 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.
- 14 March 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 370, 50-56
Injective edge chromatic index of sparse graphs
- 14 March 2025
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 370, 50-56
Injective edge chromatic index of sparse graphs
- 27 March 2024
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 40 (2) , 526-538
Burning Numbers of Barbells
- 27 March 2024
- Published by Springer Nature in Acta Mathematicae Applicatae Sinica, English Series
- Vol. 40 (2) , 526-538
Burning Numbers of Barbells
- 16 November 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 344, 120-128
On strong edge-coloring of graphs with maximum degree 5
- 16 November 2023
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 344, 120-128
On strong edge-coloring of graphs with maximum degree 5
- 7 August 2023
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 459
Anti-Ramsey problems in the Mycielskian of a cycle
- 7 August 2023
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 459
Anti-Ramsey problems in the Mycielskian of a cycle
- 15 December 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 327, 60-67
Relations between degree-based graph invariants
- 15 December 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 327, 60-67
Relations between degree-based graph invariants