Qinglin Yu - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 45 from 45

2024

A note on the minimum size of matching-saturated graphsXuechun Zhang, Hongliang Lu, Qinglin Yu. DAM, 348:1-5, 2024. [doi]

2022

Critical independent sets of König-Egerváry graphsZixuan Yang, Hongliang Lu, Qinglin Yu. DAM, 318:1-5, 2022. [doi]

2019

A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphsJun Liang, Dingjun Lou, Zongrong Qin, Qinglin Yu. jco, 38(2):589-607, 2019. [doi]

Characterizations of graphs G having all [1, k]-factors in kGHongliang Lu, Mikio Kano, Qinglin Yu. DM, 342(12), 2019. [doi]

Binding Number, Toughness and General Matching Extendability in GraphsHongliang Lu, Qinglin Yu. dmtcs, 21(3), 2019. [doi]

PrefaceQinglin Yu, Yuqing Lin. join, 19(1):1902001, 2019. [doi]

2016

Generalization of Matching Extensions in Graphs (IV): ClosuresHongliang Lu, Qinglin Yu. gc, 32(5):2009-2018, 2016. [doi]

2014

A Note on Cyclic Connectivity and Matching Properties of Regular GraphsMichael D. Plummer, Tao Wang, Qinglin Yu. gc, 30(4):1003-1011, 2014. [doi]

Uniformly Weighted Star-Factors of GraphsYunjian Wu, Qinglin Yu. arscom, 113:391-404, 2014.

2013

On Superconnectivity of (4, g)-CagesHongliang Lu, Yunjian Wu, Yuqing Lin, Qinglin Yu, Camino Balbuena, Xavier Marcote. gc, 29(1):105-119, 2013. [doi]

On the Existence of General Factors in Regular GraphsHongliang Lu, David G. L. Wang, Qinglin Yu. siamdm, 27(4):1862-1869, 2013. [doi]

On Some Properties of CagesTao Wang, Baogang Xu, Qinglin Yu. arscom, 108:201-208, 2013.

2012

On Cartesian Product of Factor-Critical GraphsZefang Wu, Xu Yang, Qinglin Yu. gc, 28(5):723-736, 2012. [doi]

2011

Generalization of matching extensions in graphs (III)Bing Bai, Hongliang Lu, Qinglin Yu. DAM, 159(8):727-732, 2011. [doi]

General fractional f-factor numbers of graphsHongliang Lu, Qinglin Yu. appml, 24(4):519-523, 2011. [doi]

Vertex-coloring 2-edge-weighting of graphsHongliang Lu, Qinglin Yu, Cun-Quan Zhang. ejc, 32(1):21-27, 2011. [doi]

Strong product of factor-critical graphsZefang Wu, Xu Yang, Qinglin Yu. ijcm, 88(13):2685-2696, 2011. [doi]

2010

Star-Uniform GraphsMikio Kano, Yunjian Wu, Qinglin Yu. gc, 26(3):383-394, 2010. [doi]

Component factors with large components in graphsM. Kano, Hongliang Lu, Qinglin Yu. appml, 23(4):385-389, 2010. [doi]

On superconnectivity of (4, ::::g::::)-cages with even girthYuqing Lin, Hongliang Lu, Yunjian Wu, Qinglin Yu. networks, 56(2):143-148, 2010. [doi]

On existence of [a, b]-factors avoiding given subgraphsYinghong Ma, Qinglin Yu. arscom, 96, 2010.

A note on graph minors and strong productsZefang Wu, Xu Yang, Qinglin Yu. appml, 23(10):1179-1182, 2010. [doi]

2009

On Tutte polynomial uniqueness of twisted wheelsYinghua Duan, Haidong Wu, Qinglin Yu. DM, 309(4):926-936, 2009. [doi]

Factor-critical property in 3-dominating-critical graphsTao Wang, Qinglin Yu. DM, 309(5):1079-1083, 2009. [doi]

Vertex arboricity of integer distance graph G(D::m, k::)Lian-Cui Zuo, Qinglin Yu, Jian-Liang Wu. DM, 309(6):1649-1657, 2009. [doi]

2008

On chromatic and flow polynomial unique graphsYinghua Duan, Haidong Wu, Qinglin Yu. DAM, 156(12):2300-2309, 2008. [doi]

Strongly pan-factorial property in cagesGuizhen Liu, Qinglin Yu. arscom, 87, 2008.

2007

Generalization of matching extensions in graphs (II)Zemin Jin, Huifang Yan, Qinglin Yu. DAM, 155(10):1267-1274, 2007. [doi]

Maximum fractional factors in graphsGuizhen Liu, Qinglin Yu, Lanju Zhang. appml, 20(12):1237-1243, 2007. [doi]

Uniform star-factors of graphs with girth threeYunjian Wu, Qinglin Yu. ajc, 39:155-162, 2007. [doi]

2006

Tree coloring of distance graphs with a real interval setLiancui Zuo, Qinglin Yu, Jianliang Wu. appml, 19(12):1341-1344, 2006. [doi]

2005

Pan-Factorial Property in Regular GraphsM. Kano, Qinglin Yu. combinatorics, 12, 2005. [doi]

Isolated Toughness and Existence of ::::f:::: -FactorsYinghong Ma, Qinglin Yu. cjcdgcgt 2007: 120-129 [doi]

Fractional Vertex Arboricity of GraphsQinglin Yu, Liancui Zuo. cjcdgcgt 2007: 245-252 [doi]

2004

Connectivity of k-extendable graphs with large kDingjun Lou, Qinglin Yu. DAM, 136(1):55-61, 2004. [doi]

Sufficient conditions for n-matchable graphsDingjun Lou, Qinglin Yu. ajc, 29:127-134, 2004. [doi]

2001

Generalization of matching extensions in graphsGuizhen Liu, Qinglin Yu. DM, 231(1-3):311-320, 2001. [doi]

1998

Toughness and Perfect Matchings in GraphsGuizhen Liu, Qinglin Yu. arscom, 48, 1998.

1996

Perfect double covers with paths of length fourK. Heinrich, P. Horak, W. Wallis, Qinglin Yu. jgt, 21(2):187-197, 1996. [doi]

1995

On 2-extendable abelian Cayley graphsOnn Chan, C. C. Chen, Qinglin Yu. DM, 146(1-3):19-32, 1995. [doi]

1993

Characterizations of various matching extensions in graphsQinglin Yu. ajc, 7:55-64, 1993. [doi]

1992

On the classification of 2-extendable Cayley graphs on dihedral groupsC. C. Chen, Jiping Liu, Qinglin Yu. ajc, 6:209-220, 1992. [doi]

n-extendable graphsQinglin Yu. jgt, 16(4):349-353, 1992. [doi]

Classifying 2-extendable generalized Petersen graphsQinglin Yu. DM, 103(2):209-220, 1992. [doi]

1990

On barrier sets of star-factorsQinglin Yu. gc, 6(1):71-76, 1990. [doi]

Sign in or sign up to see more results.

runs on WebDSL