Yuanqiu Huang

Yuanqiu Huang


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2014 in Discrete Mathematics
Verified
Journal Article
Closed access
ZOZhangDong Ouyang
ZhangDong Ouyang
JWJing Wang
Jing Wang
YHYuanqiu Huang
Yuanqiu Huang

5 February 2024 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
LZLicheng Zhang
Licheng Zhang
YHYuanqiu Huang
Yuanqiu Huang

9 April 2021 in The Electronic Journal of Combinatorics
Verified
Journal Article
Open access
PDF file
YHYuanqiu Huang
Yuanqiu Huang
ZOZhangdong Ouyang
Zhangdong Ouyang
FDFengming Dong
Fengming Dong
A graph is called $1$-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let $G$ be a bipartite $1$-planar graph with $n$ ($n\ge 4$) vertices and $m$ edges. Karpov showed that $m\le 3n-8$ holds for even $n\ge 8$ and $m\le 3n-9$ holds for odd $n\ge 7$. Czap, Przybyło and Škrabul'áková proved that if the partite sets of $G$ are of sizes $x$ and $y$, then $m\le 2n+6x-12$ holds for $2\leq x\leq y$, and conjectured that $m\le 2n+4x-12$ holds for $x\ge 3$ and $y\ge 6x-12$. In this paper, we settle their conjecture and our result is even under a weaker condition $2\le x\le y$.

18 April 2025 in Journal of Graph Theory
Verified
Journal Article
Closed access
LZLicheng Zhang
Licheng Zhang
YHYuanqiu Huang
Yuanqiu Huang
SLShengxiang Lv
Shengxiang Lv
FDFengming Dong
Fengming Dong

1 January 2024 in Discussiones Mathematicae Graph Theory
Verified
Journal Article
Closed access
YHYuanqiu Huang
Yuanqiu Huang
LZLicheng Zhang
Licheng Zhang
YWYuxi Wang
Yuxi Wang

14 July 2020 in Journal of Graph Theory
Verified
Journal Article
Closed access
PDF file
ZOZhangdong Ouyang
Zhangdong Ouyang
YHYuanqiu Huang
Yuanqiu Huang
FDFengming Dong
Fengming Dong
ETEng Guan Tay
Eng Guan Tay