Junqing Cai

Tianjin Normal University — China

Computer Science · Physical Sciences

7h-index127citations40works0.22yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(26), Limits and Structures in Graph Theory(15), Graph Labeling and Dimension Problems(13), Graph theory and applications(9), graph theory and CDMA systems(7)

Publications40 total

Longest cycles in 5-connected graphs
Discrete Mathematics Algorithms and Applications·2025
Fan-type condition for two completely independent spanning trees
Theoretical Computer Science·2025
Ore-type condition for antidirected Hamilton cycles in oriented graphs
arXiv (Cornell University)·2025Open Access
Fan's condition for completely independent spanning trees
arXiv (Cornell University)·2025Open Access
Fan-Type Condition for Two Completely Independent Spanning Trees
SSRN Electronic Journal·2025· 1 citedOpen Access
Independent Set, Chromatic Number, Non-Uniform Coloring of 2-Connected Outerplanar Graphs and Beyond
Journal of Interconnection Networks·2024
Spanning trees with few branch vertices in K1,4-free graphs
Discrete Mathematics·2024
Anti-van der Waerden Numbers of Some 2-Connected Outerplanar Graphs
Journal of Interconnection Networks·2024
Longest Cycles in 5-Connected Graphs
SSRN Electronic Journal·2024· 1 citedOpen Access
Conditions for Implicit-Degree Sum for Spanning Trees with Few Leaves in K1,4-Free Graphs
Mathematics·2023· 1 citedOpen Access
On construction for trees making the equality hold in Vizing's conjecture
Journal of Graph Theory·2022· 1 citedOpen Access
On the complexity of local-equitable coloring of graphs
Theoretical Computer Science·2022· 2 cited
Harary index of Eulerian graphs
Journal of Mathematical Chemistry·2021· 6 cited
On graphs with some normalized Laplacian eigenvalue of extremal multiplicity
arXiv (Cornell University)·2020· 2 citedOpen Access
A Generalization of Implicit Ore-condition for Hamiltonicity of k-connected Graphs
Acta Mathematicae Applicatae Sinica English Series·2020· 1 cited
One-Way Substitution Newsboy Problem under Retailer’s Budget Constraint
Mathematical Problems in Engineering·2020· 1 citedOpen Access
Systems approach for the safety and security of hazardous chemicals
Maritime Policy & Management·2020· 14 cited
Spanning trees with at most 4 leaves in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll" id="d1e63" altimg="si162.gif"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs
Discrete Mathematics·2019· 3 cited
Degree sum conditions on two disjoint cycles in graphs
Information Processing Letters·2018· 4 cited
An implicit degree condition for k-connected 2-heavy graphs to be hamiltonian
Information Processing Letters·2018· 1 cited
page 1 of 2Next →

Frequent Co-authors

Hao Li(4), Wantao Ning(4), Hao Li(3), Yu‐Zhong Zhang(3), Zuosong Liang(3), Jie Ma(3), Jin Yan(2), Shaohua Zhang(2), Hao Li(2), Linlin Zhang(2), Qiang Sun(2), Yinghui Xu(2), Xia Li(2), Xingchao Deng(2), Yingyu Zhang(1), Chang Sun(1), Wei Shan(1), Linlin Jing(1), Wei Shao(1), Panpan Wang(1)