Kiyoshi Yoshimoto

52 papers Journal 51Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
Sufficient conditions for edge-colored bipartite graphs to have rainbow and properly colored spanning trees.
Discret. Math.
Shinya Fujita, Mikio Kano, Shun-ichi Maezawa, Masao Tsugaki, Kiyoshi Yoshimoto
2024 J jnl
Spanning even trees of graphs.
J. Graph Theory
Bill Jackson, Kiyoshi Yoshimoto
2023 J jnl
Disjoint properly colored cycles in edge-colored complete bipartite graphs.
Discret. Math.
Kiyoshi Yoshimoto
2023 J jnl
On connectivities of edge-colored graphs.
Discret. Appl. Math.
Kiyoshi Yoshimoto
2021 J jnl
Edge-colored complete graphs without properly colored even cycles: A full characterization.
J. Graph Theory
Ruonan Li, Hajo Broersma, Maho Yokota, Kiyoshi Yoshimoto
2020 J jnl
A complete bipartite graph without properly colored cycles of length four.
J. Graph Theory
Roman Cada, Kenta Ozeki, Kiyoshi Yoshimoto
2018 J jnl
A panconnectivity theorem for bipartite graphs.
Discret. Math.
Hui Du, Ralph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto
2018 J jnl
Pairs of forbidden subgraphs and 2-connected supereulerian graphs.
Discret. Math.
Roman Cada, Kenta Ozeki, Liming Xiong, Kiyoshi Yoshimoto
2017 J jnl
On Dominating Even Subgraphs in Cubic Graphs.
SIAM J. Discret. Math.
Roman Cada, Shuya Chiba, Kenta Ozeki, Kiyoshi Yoshimoto
2016 J jnl
Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs.
Graphs Comb.
Ralph J. Faudree, Jenö Lehel, Kiyoshi Yoshimoto
2016 J jnl
Locating sets of vertices on Hamiltonian cycles.
Discret. Appl. Math.
Ralph J. Faudree, Hao Li, Kiyoshi Yoshimoto
2016 J jnl
Rainbow cycles in edge-colored graphs.
Discret. Math.
Roman Cada, Atsushi Kaneko, Zdenek Ryjácek, Kiyoshi Yoshimoto
2016 J jnl
Vertex Coloring of Graphs by Total 2-Weightings.
Graphs Comb.
Jonathan Hulgan, Jeno Lehel, Kenta Ozeki, Kiyoshi Yoshimoto
2015 J jnl
2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths.
Graphs Comb.
Roman Cada, Shuya Chiba, Kiyoshi Yoshimoto
2015 J jnl
2-factors with bounded number of components in claw-free graphs.
Discret. Math.
Kenta Ozeki, Zdenek Ryjácek, Kiyoshi Yoshimoto
2015 J jnl
A Relationship Between Thomassen's Conjecture and Bondy's Conjecture.
SIAM J. Discret. Math.
Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto
2015 J jnl
Equivalence of Jackson's and Thomassen's conjectures.
J. Comb. Theory B
Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto
2014 J jnl
An Extremal Problem Resulting in Many Paths.
Ars Comb.
Richard H. Schelp, Kiyoshi Yoshimoto
2014 J jnl
Note on Locating Pairs of Vertices on Hamiltonian Cycles.
Graphs Comb.
Ralph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto
2013 J jnl
4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski.
SIAM J. Discret. Math.
Roman Cada, Shuya Chiba, Kenta Ozeki, Petr Vrána, Kiyoshi Yoshimoto
2012 J jnl
2-factors and independent sets on claw-free graphs.
Discret. Math.
Roman Kuzel, Kenta Ozeki, Kiyoshi Yoshimoto
2012 J jnl
Claw-free graphs and 2-factors that separate independent vertices.
J. Graph Theory
Ralph J. Faudree, Colton Magnant, Kenta Ozeki, Kiyoshi Yoshimoto
2011 J jnl
2-factors in claw-free graphs.
Electron. Notes Discret. Math.
Roman Cada, Shuya Chiba, Kiyoshi Yoshimoto
2010 J jnl
A 2-factor in which each cycle contains a vertex in a specified stable set.
Australas. J Comb.
Shuya Chiba, Yoshimi Egawa, Kiyoshi Yoshimoto
2010 J jnl
Closure concept for 2-factors in claw-free graphs.
Discret. Math.
Zdenek Ryjácek, Liming Xiong, Kiyoshi Yoshimoto
2010 J jnl
Set-orderedness as a generalization of k-orderedness and cyclability.
Discret. Math.
Keishi Ishii, Kenta Ozeki, Kiyoshi Yoshimoto
2009 J jnl
Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs.
Graphs Comb.
Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto
2009 J jnl
Spanning even subgraphs of 3-edge-connected graphs.
J. Graph Theory
Bill Jackson, Kiyoshi Yoshimoto
2009 J jnl
lambda-backbone colorings along pairwise disjoint stars and matchings.
Discret. Math.
Haitze J. Broersma, Jun Fujisawa, Bert Marchal, Daniël Paulusma, A. N. M. Salman, Kiyoshi Yoshimoto
2008 J jnl
Edge degrees and dominating cycles.
Discret. Math.
Kiyoshi Yoshimoto
2008 J jnl
On a Spanning Tree with Specified Leaves.
Graphs Comb.
Yoshimi Egawa, Haruhide Matsuda, Tomoki Yamashita, Kiyoshi Yoshimoto
2008 J jnl
Relative length of longest paths and longest cycles in triangle-free graphs.
Discret. Math.
Daniël Paulusma, Kiyoshi Yoshimoto
2007 J jnl
Cycles through specified vertices in triangle-free graphs.
Discuss. Math. Graph Theory
Daniël Paulusma, Kiyoshi Yoshimoto
2007 J jnl
Even subgraphs of bridgeless graphs and 2-factors of line graphs.
Discret. Math.
Bill Jackson, Kiyoshi Yoshimoto
2007 J jnl
On components of 2-factors in claw-free graphs.
Electron. Notes Discret. Math.
Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto
2007 J jnl
On the number of components in 2-factors of claw-free graphs.
Discret. Math.
Kiyoshi Yoshimoto
2007 J jnl
The upper bound of the number of cycles in a 2-factor of a line graph.
J. Graph Theory
Jun Fujisawa, Liming Xiong, Kiyoshi Yoshimoto, Shenggui Zhang
2007 J jnl
Toughness and hamiltonicity in k-trees.
Discret. Math.
Hajo Broersma, Liming Xiong, Kiyoshi Yoshimoto
2005 J jnl
Heavy cycles passing through some specified vertices in weighted graphs.
J. Graph Theory
Jun Fujisawa, Kiyoshi Yoshimoto, Shenggui Zhang
2003 J jnl
A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition.
J. Graph Theory
Atsushi Kaneko, Kiyoshi Yoshimoto
2002 J jnl
On a 2-factor with a specified edge in a graph satisfying the Ore condition.
Discret. Math.
Atsushi Kaneko, Kiyoshi Yoshimoto
2002 J jnl
On a hamiltonian cycle in which specified vertices are not isolated.
Discret. Math.
Atsushi Kaneko, Ken-ichi Kawarabayashi, Katsuhiro Ota, Kiyoshi Yoshimoto
2002 J jnl
On geometric independency trees for points in the plane.
Discret. Math.
Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto
2001 J jnl
On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly Distributed.
J. Comb. Theory B
Atsushi Kaneko, Kiyoshi Yoshimoto
2001 J jnl
The Connectivities of Trunk Graphs of Connected Graphs.
Ars Comb.
Kiyoshi Yoshimoto
2001 J jnl
Transformation of Spanning Trees in a 2-Connected Graph.
Ars Comb.
Takayuki Nakamura, Kiyoshi Yoshimoto
2000 J jnl
A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdös condition.
Electron. Notes Discret. Math.
Atsushi Kaneko, Kiyoshi Yoshimoto
2000 J jnl
Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane.
Int. J. Comput. Geom. Appl.
Atsushi Kaneko, Mikio Kano, Kiyoshi Yoshimoto
2000 J jnl
Hamiltonian cycles of certain kinds of graphs satisfying Dirac condition.
Electron. Notes Discret. Math.
Kiyoshi Yoshimoto
2000 J jnl
On spanning trees with restricted degrees.
Inf. Process. Lett.
Atsushi Kaneko, Kiyoshi Yoshimoto
1999 — conf
Some results on geometric independency trees.
CCCG
Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto
1999 J jnl
The Connectivities of Leaf Graphs of 2-Connected Graphs.
J. Comb. Theory B
Atsushi Kaneko, Kiyoshi Yoshimoto