Some results on geometric independency trees. - Atsushi Kaneko; Yoshiaki Oda; Kiyoshi Yoshimoto (CCCG, 1999)

The Connectivities of Leaf Graphs of 2-Connected Graphs. - Atsushi Kaneko; Kiyoshi Yoshimoto (J. Comb. Theory B, 1999)

A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdös condition. - Atsushi Kaneko; Kiyoshi Yoshimoto (Electron. Notes Discret. Math., 2000)

Hamiltonian cycles of certain kinds of graphs satisfying Dirac condition. - Kiyoshi Yoshimoto (Electron. Notes Discret. Math., 2000)

Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane. - Atsushi Kaneko; Mikio Kano; Kiyoshi Yoshimoto (Int. J. Comput. Geom. Appl., 2000)

On spanning trees with restricted degrees. - Atsushi Kaneko; Kiyoshi Yoshimoto (Inf. Process. Lett., 2000)

Transformation of Spanning Trees in a 2-Connected Graph. - Takayuki Nakamura; Kiyoshi Yoshimoto (Ars Comb., 2001)

The Connectivities of Trunk Graphs of Connected Graphs. - Kiyoshi Yoshimoto (Ars Comb., 2001)

On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly Distributed. - Atsushi Kaneko; Kiyoshi Yoshimoto (J. Comb. Theory B, 2001)

Contractible Edges and Bowties in a k-Connected Graph. - Kiyoshi Ando; Atsushi Kaneko; Ken-ichi Kawarabayashi; Kiyoshi Yoshiomoto (Ars Comb., 2002)

On a hamiltonian cycle in which specified vertices are not isolated. - Atsushi Kaneko; Ken-ichi Kawarabayashi; Katsuhiro Ota; Kiyoshi Yoshimoto (Discret. Math., 2002)

On geometric independency trees for points in the plane. - Atsushi Kaneko; Yoshiaki Oda; Kiyoshi Yoshimoto (Discret. Math., 2002)

On a 2-factor with a specified edge in a graph satisfying the Ore condition. - Atsushi Kaneko; Kiyoshi Yoshimoto (Discret. Math., 2002)

A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition. - Atsushi Kaneko; Kiyoshi Yoshimoto (J. Graph Theory, 2003)

Heavy cycles passing through some specified vertices in weighted graphs. - Jun Fujisawa; Kiyoshi Yoshimoto; Shenggui Zhang (J. Graph Theory, 2005)

Toughness and hamiltonicity in k-trees. - Hajo Broersma; Liming Xiong; Kiyoshi Yoshimoto (Discret. Math., 2007)

Even subgraphs of bridgeless graphs and 2-factors of line graphs. - Bill Jackson; Kiyoshi Yoshimoto (Discret. Math., 2007)

On the number of components in 2-factors of claw-free graphs. - Kiyoshi Yoshimoto (Discret. Math., 2007)

Cycles through specified vertices in triangle-free graphs. - Daniël Paulusma; Kiyoshi Yoshimoto (Discuss. Math. Graph Theory, 2007)

On components of 2-factors in claw-free graphs. - Hajo Broersma; Daniël Paulusma; Kiyoshi Yoshimoto (Electron. Notes Discret. Math., 2007)

The upper bound of the number of cycles in a 2-factor of a line graph. - Jun Fujisawa; Liming Xiong; Kiyoshi Yoshimoto; Shenggui Zhang (J. Graph Theory, 2007)

Relative length of longest paths and longest cycles in triangle-free graphs. - Daniël Paulusma; Kiyoshi Yoshimoto (Discret. Math., 2008)

Edge degrees and dominating cycles. - Kiyoshi Yoshimoto (Discret. Math., 2008)

On a Spanning Tree with Specified Leaves. - Yoshimi Egawa; Haruhide Matsuda; Tomoki Yamashita; Kiyoshi Yoshimoto (Graphs Comb., 2008)

lambda-backbone colorings along pairwise disjoint stars and matchings. - Haitze J. Broersma; Jun Fujisawa; Bert Marchal; Daniël Paulusma; A. N. M. Salman; Kiyoshi Yoshimoto (Discret. Math., 2009)

Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs. - Hajo Broersma; Daniël Paulusma; Kiyoshi Yoshimoto (Graphs Comb., 2009)

Spanning even subgraphs of 3-edge-connected graphs. - Bill Jackson; Kiyoshi Yoshimoto (J. Graph Theory, 2009)

A 2-factor in which each cycle contains a vertex in a specified stable set. - Shuya Chiba; Yoshimi Egawa; Kiyoshi Yoshimoto (Australas. J Comb., 2010)

Set-orderedness as a generalization of k-orderedness and cyclability. - Keishi Ishii; Kenta Ozeki; Kiyoshi Yoshimoto (Discret. Math., 2010)

Closure concept for 2-factors in claw-free graphs. - Zdenek Ryjácek; Liming Xiong; Kiyoshi Yoshimoto (Discret. Math., 2010)

2-factors in claw-free graphs. - Roman Cada; Shuya Chiba; Kiyoshi Yoshimoto (Electron. Notes Discret. Math., 2011)

2-factors and independent sets on claw-free graphs. - Roman Kuzel; Kenta Ozeki; Kiyoshi Yoshimoto (Discret. Math., 2012)

Claw-free graphs and 2-factors that separate independent vertices. - Ralph J. Faudree; Colton Magnant; Kenta Ozeki; Kiyoshi Yoshimoto (J. Graph Theory, 2012)

4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski. - Roman Cada; Shuya Chiba; Kenta Ozeki; Petr Vrána; Kiyoshi Yoshimoto (SIAM J. Discret. Math., 2013)

An Extremal Problem Resulting in Many Paths. - Richard H. Schelp; Kiyoshi Yoshimoto (Ars Comb., 2014)

Note on Locating Pairs of Vertices on Hamiltonian Cycles. - Ralph J. Faudree; Jeno Lehel; Kiyoshi Yoshimoto (Graphs Comb., 2014)

2-factors with bounded number of components in claw-free graphs. - Kenta Ozeki; Zdenek Ryjácek; Kiyoshi Yoshimoto (Discret. Math., 2015)

2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths. - Roman Cada; Shuya Chiba; Kiyoshi Yoshimoto (Graphs Comb., 2015)

Equivalence of Jackson's and Thomassen's conjectures. - Roman Cada; Shuya Chiba; Kenta Ozeki; Petr Vrána; Kiyoshi Yoshimoto (J. Comb. Theory B, 2015)

A Relationship Between Thomassen's Conjecture and Bondy's Conjecture. - Roman Cada; Shuya Chiba; Kenta Ozeki; Petr Vrána; Kiyoshi Yoshimoto (SIAM J. Discret. Math., 2015)

Locating sets of vertices on Hamiltonian cycles. - Ralph J. Faudree; Hao Li 002; Kiyoshi Yoshimoto (Discret. Appl. Math., 2016)

Rainbow cycles in edge-colored graphs. - Roman Cada; Atsushi Kaneko; Zdenek Ryjácek; Kiyoshi Yoshimoto (Discret. Math., 2016)

Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs. - Ralph J. Faudree; Jenö Lehel; Kiyoshi Yoshimoto (Graphs Comb., 2016)

Vertex Coloring of Graphs by Total 2-Weightings. - Jonathan Hulgan; Jeno Lehel; Kenta Ozeki; Kiyoshi Yoshimoto (Graphs Comb., 2016)

On Dominating Even Subgraphs in Cubic Graphs. - Roman Cada; Shuya Chiba; Kenta Ozeki; Kiyoshi Yoshimoto (SIAM J. Discret. Math., 2017)

Pairs of forbidden subgraphs and 2-connected supereulerian graphs. - Roman Cada; Kenta Ozeki; Liming Xiong; Kiyoshi Yoshimoto (Discret. Math., 2018)

A panconnectivity theorem for bipartite graphs. - Hui Du; Ralph J. Faudree; Jeno Lehel; Kiyoshi Yoshimoto (Discret. Math., 2018)

A complete bipartite graph without properly colored cycles of length four. - Roman Cada; Kenta Ozeki; Kiyoshi Yoshimoto (J. Graph Theory, 2020)

Edge-colored complete graphs without properly colored even cycles: A full characterization. - Ruonan Li; Hajo Broersma; Maho Yokota; Kiyoshi Yoshimoto (J. Graph Theory, 2021)

On connectivities of edge-colored graphs. - Kiyoshi Yoshimoto (Discret. Appl. Math., 2023)

Disjoint properly colored cycles in edge-colored complete bipartite graphs. - Kiyoshi Yoshimoto (Discret. Math., 2023)

Spanning even trees of graphs. - Bill Jackson; Kiyoshi Yoshimoto (J. Graph Theory, 2024)