default search action
Qinglin Yu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j44]Xuechun Zhang, Hongliang Lu, Qinglin Yu:
A note on the minimum size of matching-saturated graphs. Discret. Appl. Math. 348: 1-5 (2024) - 2022
- [j43]Zixuan Yang, Hongliang Lu, Qinglin Yu:
Critical independent sets of König-Egerváry graphs. Discret. Appl. Math. 318: 1-5 (2022)
2010 – 2019
- 2019
- [j42]Hongliang Lu, Mikio Kano, Qinglin Yu:
Characterizations of graphs G having all [1, k]-factors in kG. Discret. Math. 342(12) (2019) - [j41]Hongliang Lu, Qinglin Yu:
Binding Number, Toughness and General Matching Extendability in Graphs. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [j40]Jun Liang, Dingjun Lou, Zongrong Qin, Qinglin Yu:
A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs. J. Comb. Optim. 38(2): 589-607 (2019) - [j39]Qinglin Yu, Yuqing Lin:
Preface. J. Interconnect. Networks 19(1): 1902001:1-1902001:2 (2019) - 2016
- [j38]Hongliang Lu, Qinglin Yu:
Generalization of Matching Extensions in Graphs (IV): Closures. Graphs Comb. 32(5): 2009-2018 (2016) - 2014
- [j37]Yunjian Wu, Qinglin Yu:
Uniformly Weighted Star-Factors of Graphs. Ars Comb. 113: 391-404 (2014) - [j36]Michael D. Plummer, Tao Wang, Qinglin Yu:
A Note on Cyclic Connectivity and Matching Properties of Regular Graphs. Graphs Comb. 30(4): 1003-1011 (2014) - 2013
- [j35]Tao Wang, Baogang Xu, Qinglin Yu:
On Some Properties of Cages. Ars Comb. 108: 201-208 (2013) - [j34]Hongliang Lu, Yunjian Wu, Yuqing Lin, Qinglin Yu, Camino Balbuena, Xavier Marcote:
On Superconnectivity of (4, g)-Cages. Graphs Comb. 29(1): 105-119 (2013) - [j33]Hongliang Lu, David G. L. Wang, Qinglin Yu:
On the Existence of General Factors in Regular Graphs. SIAM J. Discret. Math. 27(4): 1862-1869 (2013) - [i1]Tao Wang, Ping Wang, Qinglin Yu:
On Murty-Simon Conjecture II. CoRR abs/1301.0460 (2013) - 2012
- [j32]Zefang Wu, Xu Yang, Qinglin Yu:
On Cartesian Product of Factor-Critical Graphs. Graphs Comb. 28(5): 723-736 (2012) - 2011
- [j31]Hongliang Lu, Qinglin Yu:
General fractional f-factor numbers of graphs. Appl. Math. Lett. 24(4): 519-523 (2011) - [j30]Bing Bai, Hongliang Lu, Qinglin Yu:
Generalization of matching extensions in graphs (III). Discret. Appl. Math. 159(8): 727-732 (2011) - [j29]Hongliang Lu, Qinglin Yu, Cun-Quan Zhang:
Vertex-coloring 2-edge-weighting of graphs. Eur. J. Comb. 32(1): 21-27 (2011) - [j28]Zefang Wu, Xu Yang, Qinglin Yu:
Strong product of factor-critical graphs. Int. J. Comput. Math. 88(13): 2685-2696 (2011) - 2010
- [j27]Mikio Kano, Hongliang Lu, Qinglin Yu:
Component factors with large components in graphs. Appl. Math. Lett. 23(4): 385-389 (2010) - [j26]Zefang Wu, Xu Yang, Qinglin Yu:
A note on graph minors and strong products. Appl. Math. Lett. 23(10): 1179-1182 (2010) - [j25]Yinghong Ma, Qinglin Yu:
On existence of [a, b]-factors avoiding given subgraphs. Ars Comb. 96 (2010) - [j24]Mikio Kano, Yunjian Wu, Qinglin Yu:
Star-Uniform Graphs. Graphs Comb. 26(3): 383-394 (2010) - [j23]Yuqing Lin, Hongliang Lu, Yunjian Wu, Qinglin Yu:
On superconnectivity of (4, g)-cages with even girth. Networks 56(2): 143-148 (2010)
2000 – 2009
- 2009
- [j22]Yinghua Duan, Haidong Wu, Qinglin Yu:
On Tutte polynomial uniqueness of twisted wheels. Discret. Math. 309(4): 926-936 (2009) - [j21]Tao Wang, Qinglin Yu:
Factor-critical property in 3-dominating-critical graphs. Discret. Math. 309(5): 1079-1083 (2009) - [j20]Lian-Cui Zuo, Qinglin Yu, Jianliang Wu:
Vertex arboricity of integer distance graph G(Dm, k). Discret. Math. 309(6): 1649-1657 (2009) - 2008
- [j19]Guizhen Liu, Qinglin Yu:
Strongly pan-factorial property in cages. Ars Comb. 87 (2008) - [j18]Yinghua Duan, Haidong Wu, Qinglin Yu:
On chromatic and flow polynomial unique graphs. Discret. Appl. Math. 156(12): 2300-2309 (2008) - 2007
- [j17]Yunjian Wu, Qinglin Yu:
Uniform star-factors of graphs with girth three. Australas. J Comb. 39: 155-162 (2007) - [j16]Guizhen Liu, Qinglin Yu, Lanju Zhang:
Maximum fractional factors in graphs. Appl. Math. Lett. 20(12): 1237-1243 (2007) - [j15]Qinglin Yu, Zhao Zhang:
Extremal properties of (1, f)-odd factors in graphs. Ars Comb. 84 (2007) - [j14]Zemin Jin, Huifang Yan, Qinglin Yu:
Generalization of matching extensions in graphs (II). Discret. Appl. Math. 155(10): 1267-1274 (2007) - [e1]Jin Akiyama, William Y. C. Chen, Mikio Kano, Xueliang Li, Qinglin Yu:
Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, Xi'an, China, November 22-24, 2005, Revised Selected Papers. Lecture Notes in Computer Science 4381, Springer 2007, ISBN 978-3-540-70665-6 [contents] - 2006
- [j13]Lian-Cui Zuo, Qinglin Yu, Jianliang Wu:
Tree coloring of distance graphs with a real interval set. Appl. Math. Lett. 19(12): 1341-1344 (2006) - 2005
- [j12]Mikio Kano, Qinglin Yu:
Pan-Factorial Property in Regular Graphs. Electron. J. Comb. 12 (2005) - [c2]Yinghong Ma, Qinglin Yu:
Isolated Toughness and Existence of f -Factors. CJCDGCGT 2005: 120-129 - [c1]Qinglin Yu, Lian-Cui Zuo:
Fractional Vertex Arboricity of Graphs. CJCDGCGT 2005: 245-252 - 2004
- [j11]Dingjun Lou, Qinglin Yu:
Sufficient conditions for n-matchable graphs. Australas. J Comb. 29: 127-134 (2004) - [j10]Dingjun Lou, Qinglin Yu:
Connectivity of k-extendable graphs with large k. Discret. Appl. Math. 136(1): 55-61 (2004) - 2001
- [j9]Guizhen Liu, Qinglin Yu:
Generalization of matching extensions in graphs. Discret. Math. 231(1-3): 311-320 (2001)
1990 – 1999
- 1998
- [j8]Guizhen Liu, Qinglin Yu:
Toughness and Perfect Matchings in Graphs. Ars Comb. 48 (1998) - 1996
- [j7]Katherine Heinrich, P. Horak, Walter D. Wallis, Qinglin Yu:
Perfect double covers with paths of length four. J. Graph Theory 21(2): 187-197 (1996) - 1995
- [j6]Onn Chan, C. C. Chen, Qinglin Yu:
On 2-extendable abelian Cayley graphs. Discret. Math. 146(1-3): 19-32 (1995) - 1993
- [j5]Qinglin Yu:
Characterizations of various matching extensions in graphs. Australas. J Comb. 7: 55-64 (1993) - 1992
- [j4]C. C. Chen, Jiping Liu, Qinglin Yu:
On the classification of 2-extendable Cayley graphs on dihedral groups. Australas. J Comb. 6: 209-220 (1992) - [j3]Qinglin Yu:
Classifying 2-extendable generalized Petersen graphs. Discret. Math. 103(2): 209-220 (1992) - [j2]Qinglin Yu:
A note on n-extendable graphs. J. Graph Theory 16(4): 349-353 (1992) - 1990
- [j1]Qinglin Yu:
On barrier sets of star-factors. Graphs Comb. 6(1): 71-76 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-23 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint