default search action
Shuya Chiba
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j46]Shuya Chiba, Koshin Yoshida:
Packing directed cycles of specified odd length into digraphs and alternating cycles into bipartite graphs. Discret. Math. 348(2): 114306 (2025) - 2023
- [j45]Shuya Chiba, Michitaka Furuya:
Ramsey-type results for path covers and path partitions. II. digraphs. Appl. Math. Comput. 458: 128205 (2023) - [j44]Shuya Chiba:
Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles. Discret. Appl. Math. 330: 1-13 (2023) - [j43]Shuya Chiba, Masao Tsugaki, Tomoki Yamashita:
A degree condition for cycles passing through specified vertices and edges. Discret. Math. 346(12): 113633 (2023) - [j42]Shuya Chiba, Yoshimi Egawa, Shinya Fujita:
Minimum Number of Edges Guaranteeing the Existence of a K1, t-Factor in a Graph. Graphs Comb. 39(2): 27 (2023) - [j41]Shuya Chiba, Katsuhiro Ota, Tomoki Yamashita:
Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two. J. Graph Theory 103(2): 340-358 (2023) - 2022
- [j40]Shuya Chiba, Michitaka Furuya:
Ramsey-Type Results for Path Covers and Path Partitions. Electron. J. Comb. 29(4) (2022) - [j39]Shuya Chiba, Masao Tsugaki, Tomoki Yamashita:
A Chvátal-Erdős condition for the existence of a cycle intersecting specified connected subgraphs. Discret. Math. 345(6): 112808 (2022) - 2021
- [j38]Shuya Chiba, Michitaka Furuya
:
A characterization of 2-connected {K1, 3, N3, 1, 1}-free non-Hamiltonian graphs. Discret. Math. 344(5): 112321 (2021) - [j37]Shuya Chiba, Jun Fujisawa
Induced Nets and Hamiltonicity of Claw-Free Graphs. Graphs Comb. 37(3): 663-690 (2021) - [j36]Shuya Chiba, Akira Saito
Spanning Bipartite Graphs with Large Degree Sum in Graphs of Odd Order. Graphs Comb. 37(5): 1841-1858 (2021) - 2020
- [j35]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) - [j34]Shuya Chiba, Eishi Mishio, Pierre Montalbano
On degree sum conditions for directed path-factors with a specified number of paths. Discret. Math. 343(12): 112114 (2020) - [j33]Shuya Chiba
Partitioning a graph into cycles with a specified number of chords. J. Graph Theory 94(3): 463-475 (2020)
2010 – 2019
- 2019
- [j32]Shuya Chiba, Michitaka Furuya, Kenta Ozeki, Masao Tsugaki, Tomoki Yamashita:
A Degree Sum Condition on the Order, the Connectivity and the Independence Number for Hamiltonicity. Electron. J. Comb. 26(4): 4 (2019) - 2018
- [j31]Shuya Chiba, Nicolas Lichiardopol:
On the existence of vertex-disjoint subgraphs with high degree sum. Discret. Appl. Math. 236: 84-95 (2018) - [j30]Shuya Chiba:
On degree sum conditions for 2-factors with a prescribed number of cycles. Discret. Math. 341(10): 2912-2918 (2018) - [j29]Shuya Chiba, Tomoki Yamashita:
Degree Conditions for the Existence of Vertex-Disjoint Cycles and Paths: A Survey. Graphs Comb. 34(1): 1-83 (2018) - [j28]Shuya Chiba, Tomoki Yamashita:
On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs. SIAM J. Discret. Math. 32(1): 394-409 (2018) - 2017
- [j27]Shuya Chiba, Jun Fujisawa, Michitaka Furuya, Hironobu Ikarashi:
Forbidden Pairs with a Common Graph Generating Almost the Same Sets. Electron. J. Comb. 24(2): 2 (2017) - [j26]Suyun Jiang, Shuya Chiba, Shinya Fujita, Jin Yan:
Vertex-disjoint copies of K1, t in K1, r-free graphs. Discret. Math. 340(4): 649-654 (2017) - [j25]Shuya Chiba, Tomoki Yamashita:
Degree sum conditions for vertex-disjoint cycles passing through specified vertices. Discret. Math. 340(4): 678-690 (2017) - [j24]Shuya Chiba, Tomoki Yamashita:
A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs. Discret. Math. 340(12): 2871-2877 (2017) - [j23]Shuya Chiba:
On the difference between hamilton cycles and 2-factors with a prescribed number of cycles. Electron. Notes Discret. Math. 61: 239-245 (2017) - [j22]Roman Cada, Shuya Chiba, Kenta Ozeki
On Dominating Even Subgraphs in Cubic Graphs. SIAM J. Discret. Math. 31(2): 890-907 (2017) - 2016
- [j21]Shuya Chiba, Masao Tsugaki:
A characterization of the graphs with high degree sum that are not covered by three cycles. Ars Comb. 128: 127-163 (2016) - [j20]Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya:
Dominating Cycles and Forbidden Pairs Containing P5. Graphs Comb. 32(5): 1773-1788 (2016) - 2015
- [j19]Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya:
Forbidden pairs and the existence of a dominating cycle. Discret. Math. 338(12): 2442-2452 (2015) - [j18]Shuya Chiba, Nicolas Lichiardopol:
Vertex-disjoint subgraphs with high degree sums. Electron. Notes Discret. Math. 49: 359-366 (2015) - [j17]Roman Cada
2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths. Graphs Comb. 31(1): 99-113 (2015) - [j16]Roman Cada
Equivalence of Jackson's and Thomassen's conjectures. J. Comb. Theory B 114: 124-147 (2015) - [j15]Roman Cada
A Relationship Between Thomassen's Conjecture and Bondy's Conjecture. SIAM J. Discret. Math. 29(1): 26-35 (2015) - 2014
- [j14]Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma
Minimum degree conditions for vertex-disjoint even cycles in large graphs. Adv. Appl. Math. 54: 105-120 (2014) - [j13]Shuya Chiba, Masao Tsugaki:
A degree sum condition for the existence of a path-factor. Ars Comb. 113: 441-450 (2014) - [j12]Shuya Chiba, Masao Tsugaki, Tomoki Yamashita:
Degree sum conditions for the circumference of 4-connected graphs. Discret. Math. 333: 66-83 (2014) - 2013
- [j11]Shuya Chiba, Shinya Fujita:
Covering vertices by a specified number of disjoint cycles, edges and isolated vertices. Discret. Math. 313(3): 269-277 (2013) - [j10]Roman Cada
Circumferences of 2-factors in claw-free graphs. Discret. Math. 313(19): 1934-1943 (2013) - [j9]Roman Cada
4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski. SIAM J. Discret. Math. 27(1): 141-144 (2013) - 2012
- [j8]Shuya Chiba, Jun Fujisawa
Long cycles in unbalanced bipartite graphs. Discret. Math. 312(11): 1857-1862 (2012) - 2011
- [j7]Roman Cada
2-factors in claw-free graphs. Electron. Notes Discret. Math. 38: 213-219 (2011) - 2010
- [j6]Shuya Chiba, Yoshimi Egawa, Kiyoshi Yoshimoto:
A 2-factor in which each cycle contains a vertex in a specified stable set. Australas. J Comb. 46: 203-210 (2010) - [j5]Shuya Chiba, Ryota Matsubara, Masao Tsugaki:
Relationships between the length of a longest path and the relative length. Australas. J Comb. 47: 91-108 (2010) - [j4]Shuya Chiba, Masao Tsugaki:
A degree sum condition for graphs to be covered by two cycles. Discret. Math. 310(13-14): 1864-1874 (2010) - [j3]Shuya Chiba, Shinya Fujita, Yunshu Gao, Guojun Li:
On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs. Graphs Comb. 26(2): 173-186 (2010) - [j2]Shuya Chiba, Ryota Matsubara, Kenta Ozeki
A k-Tree Containing Specified Vertices. Graphs Comb. 26(2): 187-205 (2010)
2000 – 2009
- 2009
- [j1]Shuya Chiba, Shinya Fujita, Ken-ichi Kawarabayashi, Tadashi Sakuma
Disjoint Even Cycles Packing. Electron. Notes Discret. Math. 34: 113-119 (2009)
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-11-13 23:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: