Kiyoshi Yoshimoto

Orcid: 0000-0002-1142-375X

According to our database1, Kiyoshi Yoshimoto authored at least 51 papers between 1999 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



Disjoint properly colored cycles in edge-colored complete bipartite graphs.
Discret. Math., 2023

On connectivities of edge-colored graphs.
Discret. Appl. Math., 2023

Edge-colored complete graphs without properly colored even cycles: A full characterization.
J. Graph Theory, 2021

A complete bipartite graph without properly colored cycles of length four.
J. Graph Theory, 2020

A panconnectivity theorem for bipartite graphs.
Discret. Math., 2018

Pairs of forbidden subgraphs and 2-connected supereulerian graphs.
Discret. Math., 2018

On Dominating Even Subgraphs in Cubic Graphs.
SIAM J. Discret. Math., 2017

Vertex Coloring of Graphs by Total 2-Weightings.
Graphs Comb., 2016

Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs.
Graphs Comb., 2016

Rainbow cycles in edge-colored graphs.
Discret. Math., 2016

Locating sets of vertices on Hamiltonian cycles.
Discret. Appl. Math., 2016

A Relationship Between Thomassen's Conjecture and Bondy's Conjecture.
SIAM J. Discret. Math., 2015

Equivalence of Jackson's and Thomassen's conjectures.
J. Comb. Theory B, 2015

2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths.
Graphs Comb., 2015

2-factors with bounded number of components in claw-free graphs.
Discret. Math., 2015

Note on Locating Pairs of Vertices on Hamiltonian Cycles.
Graphs Comb., 2014

An Extremal Problem Resulting in Many Paths.
Ars Comb., 2014

4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski.
SIAM J. Discret. Math., 2013

Claw-free graphs and 2-factors that separate independent vertices.
J. Graph Theory, 2012

2-factors and independent sets on claw-free graphs.
Discret. Math., 2012

2-factors in claw-free graphs.
Electron. Notes Discret. Math., 2011

Closure concept for 2-factors in claw-free graphs.
Discret. Math., 2010

Set-orderedness as a generalization of k-orderedness and cyclability.
Discret. Math., 2010

A 2-factor in which each cycle contains a vertex in a specified stable set.
Australas. J Comb., 2010

Spanning even subgraphs of 3-edge-connected graphs.
J. Graph Theory, 2009

Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs.
Graphs Comb., 2009

lambda-backbone colorings along pairwise disjoint stars and matchings.
Discret. Math., 2009

On a Spanning Tree with Specified Leaves.
Graphs Comb., 2008

Edge degrees and dominating cycles.
Discret. Math., 2008

Relative length of longest paths and longest cycles in triangle-free graphs.
Discret. Math., 2008

The upper bound of the number of cycles in a 2-factor of a line graph.
J. Graph Theory, 2007

On components of 2-factors in claw-free graphs.
Electron. Notes Discret. Math., 2007

Cycles through specified vertices in triangle-free graphs.
Discuss. Math. Graph Theory, 2007

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

Even subgraphs of bridgeless graphs and 2-factors of line graphs.
Discret. Math., 2007

Toughness and hamiltonicity in k-trees.
Discret. Math., 2007

Heavy cycles passing through some specified vertices in weighted graphs.
J. Graph Theory, 2005

A 2-factor with two components of a graph satisfying the Chvátal-Erdös condition.
J. Graph Theory, 2003

On a 2-factor with a specified edge in a graph satisfying the Ore condition.
Discret. Math., 2002

On geometric independency trees for points in the plane.
Discret. Math., 2002

On a hamiltonian cycle in which specified vertices are not isolated.
Discret. Math., 2002

Contractible Edges and Bowties in a k-Connected Graph.
Ars Comb., 2002

On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly Distributed.
J. Comb. Theory B, 2001

The Connectivities of Trunk Graphs of Connected Graphs.
Ars Comb., 2001

Transformation of Spanning Trees in a 2-Connected Graph.
Ars Comb., 2001

On spanning trees with restricted degrees.
Inf. Process. Lett., 2000

Alternating Hamilton Cycles with Minimum Number of Crossings in the Plane.
Int. J. Comput. Geom. Appl., 2000

Hamiltonian cycles of certain kinds of graphs satisfying Dirac condition.
Electron. Notes Discret. Math., 2000

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

The Connectivities of Leaf Graphs of 2-Connected Graphs.
J. Comb. Theory B, 1999

Some results on geometric independency trees.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999