Остановите войну!
for scientists:
default search action
Ronald J. Gould
- > Home > Persons > Ronald J. Gould
Publications
- 2020
- [j117]Guantao Chen, Shuya Chiba, Ronald J. Gould, Xiaofeng Gu, Akira Saito, Masao Tsugaki, Tomoki Yamashita:
Spanning bipartite graphs with high degree sum in graphs. Discret. Math. 343(2): 111663 (2020) - 2018
- [j113]Guantao Chen, Ronald J. Gould, Xiaofeng Gu, Akira Saito:
Cycles with a chord in dense graphs. Discret. Math. 341(8): 2131-2141 (2018) - 2015
- [j102]Guantao Chen, Ronald J. Gould, Kazuhide Hirohata, Katsuhiro Ota, Songling Shan:
Disjoint Chorded Cycles of the Same Length. SIAM J. Discret. Math. 29(2): 1030-1041 (2015) - 2012
- [j89]Guantao Chen, Yoshimi Egawa, Ronald J. Gould, Akira Saito:
Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs. Discret. Math. 312(5): 938-942 (2012) - 2008
- [j74]Guantao Chen, Ralph J. Faudree, Ronald J. Gould:
Saturation Numbers of Books. Electron. J. Comb. 15(1) (2008) - [j73]Guantao Chen, Michael Ferrara, Ronald J. Gould, John R. Schmitt:
Graphic sequences with a realization containing a complete multipartite subgraph. Discret. Math. 308(23): 5712-5721 (2008) - 2007
- [j69]Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito, Ingo Schiermeyer:
Chvátal Erdós condition and 2-factors with a specyfied number of components. Discuss. Math. Graph Theory 27(3): 401-407 (2007) - 2006
- [j63]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Cycle Extendability of Hamiltonian Interval Graphs. SIAM J. Discret. Math. 20(3): 682-689 (2006) - 2005
- [j57]Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Florian Pfender, Bing Wei:
Graph minors and linkages. J. Graph Theory 49(1): 75-91 (2005) - 2004
- [j56]Guantao Chen, Ronald J. Gould, Florian Pfender:
New Conditions for k-ordered Hamiltonian Graphs. Ars Comb. 70 (2004) - [j53]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Florian Pfender:
Linear forests and ordered cycles. Discuss. Math. Graph Theory 24(3): 359-372 (2004) - 2003
- [j50]Guantao Chen, Ronald J. Gould, Xingxing Yu:
Graph Connectivity After Path Removal. Comb. 23(2): 185-203 (2003) - [j47]Guantao Chen, Ronald J. Gould, Florian Pfender, Bing Wei:
Extremal graphs for intersecting cliques. J. Comb. Theory, Ser. B 89(2): 159-171 (2003) - 2001
- [j37]Guantao Chen, Ronald J. Gould, Hao Li:
Partitioning Vertices of a Tournament into Independent Cycles. J. Comb. Theory, Ser. B 83(2): 213-220 (2001) - 2000
- [j36]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Akira Saito:
2-factors in claw-free graphs. Discuss. Math. Graph Theory 20(2): 165-172 (2000) - [j35]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Cycles in 2-Factors of Balanced Bipartite Graphs. Graphs Comb. 16(1): 67-80 (2000) - 1999
- [j33]Guantao Chen, Ronald J. Gould, Michael S. Jacobson:
On 2-factors containing 1-factors in bipartite graphs. Discret. Math. 197-198: 185-194 (1999) - 1998
- [j30]Guantao Chen, Ralph J. Faudree, Ronald J. Gould:
Intersections of Longest Cycles in k-Connected Graphs. J. Comb. Theory, Ser. B 72(1): 143-149 (1998) - 1997
- [j28]Stephan Brandt, Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak:
Degree conditions for 2-factors. J. Graph Theory 24(2): 165-173 (1997) - 1995
- [j23]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak:
Hamiltonicity in balancedk-partite graphs. Graphs Comb. 11(3): 221-231 (1995) - 1994
- [j20]Guantao Chen, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp:
Neighborhood unions and the cycle cover number of a graph. J. Graph Theory 18(7): 663-672 (1994)
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-02-06 23:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint