Qinglin Yu

According to our database, Qinglin Yu authored at least 46 papers between 1990 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Critical independent sets of König-Egerváry graphs.

Zixuan Yang, Hongliang Lu, Qinglin Yu

Discret. Appl. Math., 2022

2019

Preface.

Qinglin Yu, Yuqing Lin

J. Interconnect. Networks, 2019

A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs.

Jun Liang, Dingjun Lou, Zongrong Qin, Qinglin Yu

J. Comb. Optim., 2019

Binding Number, Toughness and General Matching Extendability in Graphs.

Hongliang Lu, Qinglin Yu

Discret. Math. Theor. Comput. Sci., 2019

Characterizations of graphs G having all [1, k]-factors in kG.

Hongliang Lu, Mikio Kano, Qinglin Yu

Discret. Math., 2019

2016

Generalization of Matching Extensions in Graphs (IV): Closures.

Hongliang Lu, Qinglin Yu

Graphs Comb., 2016

2014

A Note on Cyclic Connectivity and Matching Properties of Regular Graphs.

Michael D. Plummer, Tao Wang, Qinglin Yu

Graphs Comb., 2014

Uniformly Weighted Star-Factors of Graphs.

Yunjian Wu, Qinglin Yu

Ars Comb., 2014

2013

On the Existence of General Factors in Regular Graphs.

Hongliang Lu, David G. L. Wang, Qinglin Yu

SIAM J. Discret. Math., 2013

On Superconnectivity of (4, g)-Cages.

Hongliang Lu, Yunjian Wu, Yuqing Lin, Qinglin Yu, Camino Balbuena, Xavier Marcote

Graphs Comb., 2013

On Murty-Simon Conjecture II

Tao Wang, Ping Wang, Qinglin Yu

CoRR, 2013

On Some Properties of Cages.

Tao Wang, Baogang Xu, Qinglin Yu

Ars Comb., 2013

2012

On Cartesian Product of Factor-Critical Graphs.

Zefang Wu, Xu Yang, Qinglin Yu

Graphs Comb., 2012

2011

Strong product of factor-critical graphs.

Zefang Wu, Xu Yang, Qinglin Yu

Int. J. Comput. Math., 2011

Vertex-coloring 2-edge-weighting of graphs.

Hongliang Lu, Qinglin Yu, Cun-Quan Zhang

Eur. J. Comb., 2011

Generalization of matching extensions in graphs (III).

Bing Bai, Hongliang Lu, Qinglin Yu

Discret. Appl. Math., 2011

General fractional f-factor numbers of graphs.

Hongliang Lu, Qinglin Yu

Appl. Math. Lett., 2011

2010

On superconnectivity of (4, <i>g</i>)-cages with even girth.

Yuqing Lin, Hongliang Lu, Yunjian Wu, Qinglin Yu

Networks, 2010

Star-Uniform Graphs.

Mikio Kano, Yunjian Wu, Qinglin Yu

Graphs Comb., 2010

On existence of [a, b]-factors avoiding given subgraphs.

Yinghong Ma, Qinglin Yu

Ars Comb., 2010

A note on graph minors and strong products.

Zefang Wu, Xu Yang, Qinglin Yu

Appl. Math. Lett., 2010

Component factors with large components in graphs.

Mikio Kano, Hongliang Lu, Qinglin Yu

Appl. Math. Lett., 2010

2009

Vertex arboricity of integer distance graph G(D_{m, k}).

Lian-Cui Zuo, Qinglin Yu, Jianliang Wu

Discret. Math., 2009

Factor-critical property in 3-dominating-critical graphs.

Tao Wang, Qinglin Yu

Discret. Math., 2009

On Tutte polynomial uniqueness of twisted wheels.

Yinghua Duan, Haidong Wu, Qinglin Yu

Discret. Math., 2009

2008

On chromatic and flow polynomial unique graphs.

Yinghua Duan, Haidong Wu, Qinglin Yu

Discret. Appl. Math., 2008

Strongly pan-factorial property in cages.

Guizhen Liu, Qinglin Yu

Ars Comb., 2008

2007

Generalization of matching extensions in graphs (II).

Zemin Jin, Huifang Yan, Qinglin Yu

Discret. Appl. Math., 2007

Extremal properties of (1, f)-odd factors in graphs.

Qinglin Yu, Zhao Zhang

Ars Comb., 2007

Maximum fractional factors in graphs.

Guizhen Liu, Qinglin Yu, Lanju Zhang

Appl. Math. Lett., 2007

Uniform star-factors of graphs with girth three.

Yunjian Wu, Qinglin Yu

Australas. J Comb., 2007

2006

Tree coloring of distance graphs with a real interval set.

Lian-Cui Zuo, Qinglin Yu, Jianliang Wu

Appl. Math. Lett., 2006

2005

Pan-Factorial Property in Regular Graphs.

Mikio Kano, Qinglin Yu

Electron. J. Comb., 2005

Fractional Vertex Arboricity of Graphs.

Qinglin Yu, Lian-Cui Zuo

Proceedings of the Discrete Geometry, 2005

Isolated Toughness and Existence of <i>f</i> -Factors.

Yinghong Ma, Qinglin Yu

Proceedings of the Discrete Geometry, 2005

2004

Connectivity of k-extendable graphs with large k.

Dingjun Lou, Qinglin Yu

Discret. Appl. Math., 2004

Sufficient conditions for n-matchable graphs.

Dingjun Lou, Qinglin Yu

Australas. J Comb., 2004

2001

Generalization of matching extensions in graphs.

Guizhen Liu, Qinglin Yu

Discret. Math., 2001

1998

Toughness and Perfect Matchings in Graphs.

Guizhen Liu, Qinglin Yu

Ars Comb., 1998

1996

Perfect double covers with paths of length four.

Katherine Heinrich, P. Horak, Walter D. Wallis, Qinglin Yu

J. Graph Theory, 1996

1995

On 2-extendable abelian Cayley graphs.

Onn Chan, C. C. Chen, Qinglin Yu

Discret. Math., 1995

1993

Characterizations of various matching extensions in graphs.

Qinglin Yu

Australas. J Comb., 1993

1992

A note on <i>n</i>-extendable graphs.

Qinglin Yu

J. Graph Theory, 1992

Classifying 2-extendable generalized Petersen graphs.

Qinglin Yu

Discret. Math., 1992

On the classification of 2-extendable Cayley graphs on dihedral groups.

C. C. Chen, Jiping Liu, Qinglin Yu

Australas. J Comb., 1992

1990

On barrier sets of star-factors.

Qinglin Yu

Graphs Comb., 1990