default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKiyoshi Yoshimoto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j50]Kiyoshi Yoshimoto:
On connectivities of edge-colored graphs. Discret. Appl. Math. 325: 87-92 (2023)- [j49]Kiyoshi Yoshimoto
:
Disjoint properly colored cycles in edge-colored complete bipartite graphs. Discret. Math. 346(1): 113095 (2023) - 2021
- [j48]Ruonan Li, Hajo Broersma, Maho Yokota, Kiyoshi Yoshimoto:
Edge-colored complete graphs without properly colored even cycles: A full characterization. J. Graph Theory 98(1): 110-124 (2021) - 2020
- [j47]Roman Cada, Kenta Ozeki, Kiyoshi Yoshimoto:
A complete bipartite graph without properly colored cycles of length four. J. Graph Theory 93(2): 168-180 (2020)
2010 – 2019
- 2018
- [j46]Hui Du, Ralph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto:
A panconnectivity theorem for bipartite graphs. Discret. Math. 341(1): 151-154 (2018) - [j45]Roman Cada, Kenta Ozeki, Liming Xiong, Kiyoshi Yoshimoto:
Pairs of forbidden subgraphs and 2-connected supereulerian graphs. Discret. Math. 341(6): 1696-1707 (2018) - 2017
- [j44]Roman Cada, Shuya Chiba, Kenta Ozeki, Kiyoshi Yoshimoto:
On Dominating Even Subgraphs in Cubic Graphs. SIAM J. Discret. Math. 31(2): 890-907 (2017) - 2016
- [j43]Ralph J. Faudree, Hao Li, Kiyoshi Yoshimoto:
Locating sets of vertices on Hamiltonian cycles. Discret. Appl. Math. 209: 107-114 (2016) - [j42]Roman Cada, Atsushi Kaneko, Zdenek Ryjácek, Kiyoshi Yoshimoto:
Rainbow cycles in edge-colored graphs. Discret. Math. 339(4): 1387-1392 (2016) - [j41]Ralph J. Faudree, Jenö Lehel, Kiyoshi Yoshimoto:
Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs. Graphs Comb. 32(3): 963-986 (2016) - [j40]Jonathan Hulgan, Jeno Lehel, Kenta Ozeki, Kiyoshi Yoshimoto:
Vertex Coloring of Graphs by Total 2-Weightings. Graphs Comb. 32(6): 2461-2471 (2016) - 2015
- [j39]Kenta Ozeki, Zdenek Ryjácek, Kiyoshi Yoshimoto:
2-factors with bounded number of components in claw-free graphs. Discret. Math. 338(5): 793-808 (2015) - [j38]Roman Cada, Shuya Chiba, Kiyoshi Yoshimoto:
2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths. Graphs Comb. 31(1): 99-113 (2015) - [j37]Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto:
Equivalence of Jackson's and Thomassen's conjectures. J. Comb. Theory B 114: 124-147 (2015) - [j36]Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto:
A Relationship Between Thomassen's Conjecture and Bondy's Conjecture. SIAM J. Discret. Math. 29(1): 26-35 (2015) - 2014
- [j35]Richard H. Schelp, Kiyoshi Yoshimoto:
An Extremal Problem Resulting in Many Paths. Ars Comb. 116: 23-32 (2014) - [j34]Ralph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto:
Note on Locating Pairs of Vertices on Hamiltonian Cycles. Graphs Comb. 30(4): 887-894 (2014) - 2013
- [j33]Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto:
4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski. SIAM J. Discret. Math. 27(1): 141-144 (2013) - 2012
- [j32]Roman Kuzel, Kenta Ozeki, Kiyoshi Yoshimoto:
2-factors and independent sets on claw-free graphs. Discret. Math. 312(2): 202-206 (2012) - [j31]Ralph J. Faudree, Colton Magnant, Kenta Ozeki, Kiyoshi Yoshimoto:
Claw-free graphs and 2-factors that separate independent vertices. J. Graph Theory 69(3): 251-263 (2012) - 2011
- [j30]Roman Cada, Shuya Chiba, Kiyoshi Yoshimoto:
2-factors in claw-free graphs. Electron. Notes Discret. Math. 38: 213-219 (2011) - 2010
- [j29]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) - [j28]Zdenek Ryjácek, Liming Xiong, Kiyoshi Yoshimoto:
Closure concept for 2-factors in claw-free graphs. Discret. Math. 310(10-11): 1573-1579 (2010) - [j27]Keishi Ishii, Kenta Ozeki, Kiyoshi Yoshimoto:
Set-orderedness as a generalization of k-orderedness and cyclability. Discret. Math. 310(17-18): 2310-2316 (2010)
2000 – 2009
- 2009
- [j26]Haitze J. Broersma, Jun Fujisawa, Bert Marchal, Daniël Paulusma, A. N. M. Salman, Kiyoshi Yoshimoto:
lambda-backbone colorings along pairwise disjoint stars and matchings. Discret. Math. 309(18): 5596-5609 (2009) - [j25]Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto:
Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs. Graphs Comb. 25(4): 427-460 (2009) - [j24]Bill Jackson, Kiyoshi Yoshimoto:
Spanning even subgraphs of 3-edge-connected graphs. J. Graph Theory 62(1): 37-47 (2009) - 2008
- [j23]Daniël Paulusma, Kiyoshi Yoshimoto:
Relative length of longest paths and longest cycles in triangle-free graphs. Discret. Math. 308(7): 1222-1229 (2008) - [j22]Kiyoshi Yoshimoto:
Edge degrees and dominating cycles. Discret. Math. 308(12): 2594-2599 (2008) - [j21]Yoshimi Egawa, Haruhide Matsuda, Tomoki Yamashita, Kiyoshi Yoshimoto:
On a Spanning Tree with Specified Leaves. Graphs Comb. 24(1): 13-18 (2008) - 2007
- [j20]Hajo Broersma, Liming Xiong, Kiyoshi Yoshimoto:
Toughness and hamiltonicity in k-trees. Discret. Math. 307(7-8): 832-838 (2007) - [j19]Bill Jackson, Kiyoshi Yoshimoto:
Even subgraphs of bridgeless graphs and 2-factors of line graphs. Discret. Math. 307(22): 2775-2785 (2007) - [j18]Kiyoshi Yoshimoto:
On the number of components in 2-factors of claw-free graphs. Discret. Math. 307(22): 2808-2819 (2007) - [j17]Daniël Paulusma, Kiyoshi Yoshimoto:
Cycles through specified vertices in triangle-free graphs. Discuss. Math. Graph Theory 27(1): 179-191 (2007) - [j16]Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto:
On components of 2-factors in claw-free graphs. Electron. Notes Discret. Math. 29: 289-293 (2007) - [j15]Jun Fujisawa, Liming Xiong, Kiyoshi Yoshimoto, Shenggui Zhang:
The upper bound of the number of cycles in a 2-factor of a line graph. J. Graph Theory 55(1): 72-82 (2007) - 2005
- [j14]Jun Fujisawa, Kiyoshi Yoshimoto, Shenggui Zhang:
Heavy cycles passing through some specified vertices in weighted graphs. J. Graph Theory 49(2): 93-103 (2005) - 2003
- [j13]Atsushi Kaneko, Kiyoshi Yoshimoto:
A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition. J. Graph Theory 43(4): 269-279 (2003) - 2002
- [j12]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto:
Contractible Edges and Bowties in a k-Connected Graph. Ars Comb. 64: 239- (2002) - [j11]Atsushi Kaneko, Kiyoshi Yoshimoto:
On a 2-factor with a specified edge in a graph satisfying the Ore condition. Discret. Math. 257(2-3): 445-461 (2002) - [j10]Atsushi Kaneko, Ken-ichi Kawarabayashi, Katsuhiro Ota, Kiyoshi Yoshimoto:
On a hamiltonian cycle in which specified vertices are not isolated. Discret. Math. 258(1-3): 85-91 (2002) - [j9]Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto:
On geometric independency trees for points in the plane. Discret. Math. 258(1-3): 93-104 (2002) - 2001
- [j8]Takayuki Nakamura, Kiyoshi Yoshimoto:
Transformation of Spanning Trees in a 2-Connected Graph. Ars Comb. 60 (2001) - [j7]Kiyoshi Yoshimoto:
The Connectivities of Trunk Graphs of Connected Graphs. Ars Comb. 60 (2001) - [j6]Atsushi Kaneko, Kiyoshi Yoshimoto:
On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly Distributed. J. Comb. Theory B 81(1): 100-109 (2001) - 2000
- [j5]Atsushi Kaneko, Kiyoshi Yoshimoto:
A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdös condition. Electron. Notes Discret. Math. 5: 198-200 (2000) - [j4]Kiyoshi Yoshimoto:
Hamiltonian cycles of certain kinds of graphs satisfying Dirac condition. Electron. Notes Discret. Math. 5: 315-316 (2000) - [j3]Atsushi Kaneko, Mikio Kano, Kiyoshi Yoshimoto:
Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane. Int. J. Comput. Geom. Appl. 10(1): 73-78 (2000) - [j2]Atsushi Kaneko, Kiyoshi Yoshimoto:
On spanning trees with restricted degrees. Inf. Process. Lett. 73(5-6): 163-165 (2000)
1990 – 1999
- 1999
- [j1]Atsushi Kaneko, Kiyoshi Yoshimoto:
The Connectivities of Leaf Graphs of 2-Connected Graphs. J. Comb. Theory B 76(2): 155-169 (1999) - [c1]Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto:
Some results on geometric independency trees. CCCG 1999
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-06-10 20: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
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:
