Zhiquan Hu - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 27 from 27

2023

Spanning trees with at most k leaves in 2-connected K1,r-free graphsGuantao Chen, Yuan Chen, Zhiquan Hu, Shunzhe Zhang. amc, 445:127842, May 2023. [doi]

k-factors in squares and line graphs of treesYuan Chen, Guowei Dai, Zhiquan Hu. amc, 458:128244, December 2023. [doi]

2022

OncoSplicing: an updated database for clinically relevant alternative splicing in 33 human cancersYangjun Zhang, Xiangyang Yao, Hui Zhou, Xiaoliang Wu, Jianbo Tian, Jin Zeng, Libin Yan, Chen Duan, Haoran Liu, Heng Li, Ke Chen, Zhiquan Hu, Zhangqun Ye, Hua Xu. nar, 50(D1):1340-1347, 2022. [doi]

2020

2018

k-connected graphsZhiquan Hu, Feifei Song. jgt, 87(3):374-393, 2018. [doi]

2016

1, 2, 3}-free graph is Hamilton-connectedZhiquan Hu, Shunzhe Zhang. gc, 32(2):685-705, 2016. [doi]

2015

Weakly bipancyclic bipartite graphsZhiquan Hu, Jing Sun. DAM, 194:102-120, 2015. [doi]

2014

Degree Conditions for Spanning BroomsGuantao Chen, Michael Ferrara, Zhiquan Hu, Michael S. Jacobson, Huiqing Liu. jgt, 77(3):237-250, 2014. [doi]

2013

An Optimal Binding Number Condition for BipancyclismZhiquan Hu, Ka Ho Law, Wenan Zang. siamdm, 27(2):597-618, 2013. [doi]

Two Forbidden Subgraph Pairs for Hamiltonicity of 3-Connected GraphsZhiquan Hu, Houyuan Lin. gc, 29(6):1755-1775, 2013. [doi]

2012

Endpoint extendable paths in dense graphsGuantao Chen, Zhiquan Hu, Hao Li. DM, 312(17):2584-2592, 2012. [doi]

2011

Circumferences of ::::k::::-connected graphs involving independence numbersGuantao Chen, Zhiquan Hu, Yaping Wu. jgt, 68(1):55-76, 2011. [doi]

2009

Removable matchings and hamiltonian cyclesZhiquan Hu, Hao Li. DM, 309(5):1020-1024, 2009. [doi]

Weak cycle partition involving degree sum conditionsZhiquan Hu, Hao Li. DM, 309(4):647-654, 2009. [doi]

A constructive characterization of total domination vertex critical graphsChunxiang Wang, Zhiquan Hu, Xiangwen Li. DM, 309(4):991-996, 2009. [doi]

2008

Linked graphs with restricted lengthsGuantao Chen, Yuan Chen, Shuhong Gao, Zhiquan Hu. JCT, 98(4):735-751, 2008. [doi]

Design of System Scheme and Operationmechanism on Agricultural Science &Technology Information Service System '110'Yongchang Wu, Zhiquan Hu, Bilin Xiao, Quanxin Li. ifip12 2009: 1939-1947 [doi]

2007

Partition of a graph into cycles and verticesZhiquan Hu, Hao Li. DM, 307(11-12):1436-1440, 2007. [doi]

2005

Perfect Circular Arc ColoringXujin Chen, Zhiquan Hu, Wenan Zang. jco, 9(3):267-280, 2005. [doi]

Hamilton connectivity of line graphs and claw-free graphsZhiquan Hu, Feng Tian, Bing Wei. jgt, 50(2):130-141, 2005. [doi]

2002

Fan-type theorem for path-connectivityZhiquan Hu, Feng Tian, Bing Wei, Yoshimi Egawa, Kazuhide Hirohata. jgt, 39(4):265-282, 2002. [doi]

2001

Long Cycles through a Linear ForestZhiquan Hu, Feng Tian, Bing Wei. JCT, 82(1):67-80, 2001. [doi]

1999

A generalization of fan s condition and forbidden subgraph conditions for hamiltonicityZhiquan Hu. DM, 196(1-3):167-175, 1999. [doi]

1998

A Strongly Polynomial Algorithm for the Inverse Shortest Arborescence ProblemZhiquan Hu, Zhenhong Liu. DAM, 82(1-3):135-154, 1998. [doi]

Sign in or sign up to see more results.

runs on WebDSL