Kiyoshi Yoshimoto

Publication Activity (10 Years)

Years Active: 1999-2023
Publications (10 Years): 15

Top Topics

Bipartite Graph

Dense Subgraphs

Top Venues

SIAM J. Discret. Math.

Discret. Appl. Math.

Publications

Kiyoshi Yoshimoto
On connectivities of edge-colored graphs. Discret. Appl. Math. 325 (2023)
Kiyoshi Yoshimoto
Disjoint properly colored cycles in edge-colored complete bipartite graphs. Discret. Math. 346 (1) (2023)
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) (2021)
Roman Cada, Kenta Ozeki, Kiyoshi Yoshimoto
A complete bipartite graph without properly colored cycles of length four. J. Graph Theory 93 (2) (2020)
Roman Cada, Kenta Ozeki, Liming Xiong, Kiyoshi Yoshimoto
Pairs of forbidden subgraphs and 2-connected supereulerian graphs. Discret. Math. 341 (6) (2018)
Hui Du, Ralph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto
A panconnectivity theorem for bipartite graphs. Discret. Math. 341 (1) (2018)
Roman Cada, Shuya Chiba, Kenta Ozeki, Kiyoshi Yoshimoto
On Dominating Even Subgraphs in Cubic Graphs. SIAM J. Discret. Math. 31 (2) (2017)
Ralph J. Faudree, Jenö Lehel, Kiyoshi Yoshimoto
Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs. Graphs Comb. 32 (3) (2016)
Ralph J. Faudree, Hao Li, Kiyoshi Yoshimoto
Locating sets of vertices on Hamiltonian cycles. Discret. Appl. Math. 209 (2016)
Roman Cada, Atsushi Kaneko, Zdenek Ryjácek, Kiyoshi Yoshimoto
Rainbow cycles in edge-colored graphs. Discret. Math. 339 (4) (2016)
Jonathan Hulgan, Jeno Lehel, Kenta Ozeki, Kiyoshi Yoshimoto
Vertex Coloring of Graphs by Total 2-Weightings. Graphs Comb. 32 (6) (2016)
Kenta Ozeki, Zdenek Ryjácek, Kiyoshi Yoshimoto
2-factors with bounded number of components in claw-free graphs. Discret. Math. 338 (5) (2015)
Roman Cada, Shuya Chiba, Kiyoshi Yoshimoto
2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths. Graphs Comb. 31 (1) (2015)
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) (2015)
Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto
Equivalence of Jackson's and Thomassen's conjectures. J. Comb. Theory, Ser. B 114 (2015)
Richard H. Schelp, Kiyoshi Yoshimoto
An Extremal Problem Resulting in Many Paths. Ars Comb. 116 (2014)
Ralph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto
Note on Locating Pairs of Vertices on Hamiltonian Cycles. Graphs Comb. 30 (4) (2014)
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) (2013)
Roman Kuzel, Kenta Ozeki, Kiyoshi Yoshimoto
2-factors and independent sets on claw-free graphs. Discret. Math. 312 (2) (2012)
Ralph J. Faudree, Colton Magnant, Kenta Ozeki, Kiyoshi Yoshimoto
Claw-free graphs and 2-factors that separate independent vertices. J. Graph Theory 69 (3) (2012)
Roman Cada, Shuya Chiba, Kiyoshi Yoshimoto
2-factors in claw-free graphs. Electron. Notes Discret. Math. 38 (2011)
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 (2010)
Zdenek Ryjácek, Liming Xiong, Kiyoshi Yoshimoto
Closure concept for 2-factors in claw-free graphs. Discret. Math. 310 (10-11) (2010)
Keishi Ishii, Kenta Ozeki, Kiyoshi Yoshimoto
Set-orderedness as a generalization of k-orderedness and cyclability. Discret. Math. 310 (17-18) (2010)
Bill Jackson, Kiyoshi Yoshimoto
Spanning even subgraphs of 3-edge-connected graphs. J. Graph Theory 62 (1) (2009)
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) (2009)
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) (2009)
Yoshimi Egawa, Haruhide Matsuda, Tomoki Yamashita, Kiyoshi Yoshimoto
On a Spanning Tree with Specified Leaves. Graphs Comb. 24 (1) (2008)
Daniël Paulusma, Kiyoshi Yoshimoto
Relative length of longest paths and longest cycles in triangle-free graphs. Discret. Math. 308 (7) (2008)
Kiyoshi Yoshimoto
Edge degrees and dominating cycles. Discret. Math. 308 (12) (2008)
Kiyoshi Yoshimoto
On the number of components in 2-factors of claw-free graphs. Discret. Math. 307 (22) (2007)
Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto
On components of 2-factors in claw-free graphs. Electron. Notes Discret. Math. 29 (2007)
Hajo Broersma, Liming Xiong, Kiyoshi Yoshimoto
Toughness and hamiltonicity in k-trees. Discret. Math. 307 (7-8) (2007)
Bill Jackson, Kiyoshi Yoshimoto
Even subgraphs of bridgeless graphs and 2-factors of line graphs. Discret. Math. 307 (22) (2007)
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) (2007)
Daniël Paulusma, Kiyoshi Yoshimoto
Cycles through specified vertices in triangle-free graphs. Discuss. Math. Graph Theory 27 (1) (2007)
Jun Fujisawa, Kiyoshi Yoshimoto, Shenggui Zhang
Heavy cycles passing through some specified vertices in weighted graphs. J. Graph Theory 49 (2) (2005)
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) (2003)
Atsushi Kaneko, Kiyoshi Yoshimoto
On a 2-factor with a specified edge in a graph satisfying the Ore condition. Discret. Math. 257 (2-3) (2002)
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) (2002)
Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto
On geometric independency trees for points in the plane. Discret. Math. 258 (1-3) (2002)
Atsushi Kaneko, Kiyoshi Yoshimoto
On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly Distributed. J. Comb. Theory, Ser. B 81 (1) (2001)
Takayuki Nakamura, Kiyoshi Yoshimoto
Transformation of Spanning Trees in a 2-Connected Graph. Ars Comb. 60 (2001)
Kiyoshi Yoshimoto
The Connectivities of Trunk Graphs of Connected Graphs. Ars Comb. 60 (2001)
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 (2000)
Atsushi Kaneko, Kiyoshi Yoshimoto
On spanning trees with restricted degrees. Inf. Process. Lett. 73 (5-6) (2000)
Kiyoshi Yoshimoto
Hamiltonian cycles of certain kinds of graphs satisfying Dirac condition. Electron. Notes Discret. Math. 5 (2000)
Atsushi Kaneko, Mikio Kano, Kiyoshi Yoshimoto
Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane. Int. J. Comput. Geom. Appl. 10 (1) (2000)
Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto
Some results on geometric independency trees. CCCG (1999)
Atsushi Kaneko, Kiyoshi Yoshimoto
The Connectivities of Leaf Graphs of 2-Connected Graphs. J. Comb. Theory, Ser. B 76 (2) (1999)