Papers

Published Papers
  1. K. Yoshimoto, On Connectivities of Edge-Colored Graphs, accepted by Discrete Applied Mathematics, pdf-file

  2. K. Yoshimoto, Vertex disjoint properly colored cycles in edge-colored complete bipartite graphs, accepted by Discrete Mathematics, pdf-file

  3. R. Li, H. Broersma, M. Yokota and K. Yoshimoto, Edge-colored complete graphs without properly colored even cycles: a full characterization, J. Graph Theory 98 (2021) 110-124, pdf-file

  4. R. Cada, K. Ozeki and K. Yoshimoto, A complete bipartite graph without properly colored cycles of length four, J. Graph Theory 93 (2020) 168-180, pdf-file

  5. R. Cada, K. Ozeki, L. Xiong and K. Yoshimoto, Pairs of forbidden subgraphs and 2-connected supereulerian graphs, Discrete Mathematics 341 (2018) 1696-1707, pdf-file

  6. H. Du, R. Faudree, J. Lehel and K. Yoshimoto, A panconnectivity theorem for bipartite graphs, Discrete Math. 341 (2018) 151-154, pdf-file

  7. H. Du and K. Yoshimoto, A hamilton cycle in which specified vertices are located in polar opposite, Journal of Combinatorics 9 (2018) 35-56, pdf-file

  8. R. Cada, S. Chiba, K. Ozeki and K. Yoshimoto, On dominating even subgraphs in cubic graphs, SIAM J. Discrete Math. 31 (2017) 890-907, pdf-file


  9. R. Faudree, J. Lehel and K. Yoshimoto, Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs, Graphs and Combin. 32 (2016) 963-986, pdf-file

  10. J. Hulgan, J. Lehel, K. Ozeki and K. Yoshimoto, Vertex coloring of graphs by total 2-weightings, Graphs and Combin. 32 (2016) 2461-2471, pdf-file

  11. R. Cada, A. Kaneko, Z. Ryjacek and K. Yoshimoto, Rainbow cycles in edge-colored graphs, Discrete Mathematics 339 (2016) 1387-1392, pdf-file

  12. R. Faudree, H. Li and K. Yoshimoto, Locating Sets of Vertices on Hamiltonian Cycles, Discrete Applied Mathematics 209 (2016) 107-114, pdf-file

  13. R. Cada, S. Chiba, K. Ozeki, P. Vrana and K. Yoshimoto, Equivalence of Jackson's and Thomassen's conjectures, J. Combin. Theory Ser. B 114 (2015) 124-147, pdf-file

  14. Z. Ryjacek, K. Ozeki and K. Yoshimoto, 2-factors with bounded number of components in claw-free graphs, Discrete Mathematics 338 (2015) 793-808, pdf-file

  15. R. Cada, S. Chiba, K. Ozeki, P. Vrana and K. Yoshimoto, A relationship between Thomassen's conjecture and Bondy's conjecture, SIAM Journal on Discrete Mathematics 29 (2015) 26-35, pdf-file

  16. R. Cada, S. Chiba and K. Yoshimoto, 2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths, Graphs and Combin. 31 (2015) 99-113, pdf-file

  17. R. Faudree, J. Hulgan and K. Yoshimoto, Note on Locating Pairs of Vertices on Hamiltonian Cycles, Graphs and Combin. 30 (2014) 887-894, pdf-file

  18. R. H. Schelp and K. Yoshimoto, An Extremal Problem Resulting in Many Paths, Ars Combin. 116 (2014) 23-32, pdf-file


  19. R. Cada, S. Chiba, K. Ozeki, P Vrana and K. Yoshimoto, {4,5} is not coverable - a counterexample to Kaiser-Skrekovski conjecture, SIAM J. Discrete Math. 27 (2013) 141-144 pdf-file

  20. R. Kuzel, K. Ozeki and K. Yoshimoto, 2-factors and independent sets on claw-free graphs, Discrete Math. 312 (2012), 202-206, pdf-file

  21. R. J. Faudree, C. Magnant, K. Ozeki and K. Yoshimoto, Claw-Free Graphs and 2-Factors that Separate Independent Vertices, J. Graph Theory 69 (2012), 251-263, pdf-file

  22. S. Chiba, Y. Egawa and K. Yoshimoto, A 2-factor in which each cycle contains a vertex in a specified stable set, Australas. J. Combin. 46 (2010), 203-210, pdf-file

  23. K. Ishii, K. Ozeki and K. Yoshimoto, Set-ordered as a generalization of k-ordered, Discrete Math. 310 (2010), 2310-2316 pdf-file

  24. Z. Ryjacek, L. Xiong and K. Yoshimoto, Closure concept for 2-factors in claw-free graphs, Discrete Math. 310 (2010), 1573-1579 pdf-file


  25. H.J. Broersma, J. Fujisawa, L. Marchal, D. Paulusma, A.N.M. Salman and K. Yoshimoto, Lambda-Backbone Colorings Along Pairwise Disjoint Stars and Matchings, Discrete Math. 309 (2009), 5596-5609, pdf-file

  26. H.J. Broersma, D. Paulusma and K. Yoshimoto, Sharp upper bounds for the minimum number of components of 2-factors in claw-free graphs, Graphs Combin. 25 (2009), 427-460 pdf-file

  27. B. Jackson and K. Yoshimoto, Spanning Even Subgraphs of 3-edge-connected Graphs, J. Graph Theory 62 (2009), 37-47 pdf-file

  28. K. Yoshimoto, Edge degrees and dominating cycles, Discrete Math. 308 (2008), 2594-2599, pdf-file

  29. Y. Egawa, H. Matsuda, T. Yamashita, K. Yoshimoto, On a spanning tree with specified leaves, Graphs Combin. 24 (2008), 13-18, pdf-file

  30. D. Paulusma and K. Yoshimoto, Relative length of longest paths and longest cycles in a triangle-free graph, Discrete Math. 308, 1222-1229 (2008) pdf-file

  31. K. Yoshimoto, On the number of components in 2-factors of claw-free graphs, Discrete Math. 307 (2007), 2808-2819, pdf-file

  32. B. Jackson and K. Yoshimoto, Even subgraphs of bridgeless graphs and 2-factors of line graphs, Discrete Math. 307, 2775-2785 (2007) pdf-file

  33. D. Paulusma and K. Yoshimoto, Cycles through specified vertices in a triangle-free graph, Discuss. Math. Graph Theory 27, 179-192 (2007), pdf-file

  34. H. Broersma, L. Xiong and K. Yoshimoto, Toughness and hamiltonicity in k-trees, Discrete Math. 307, 832-838 (2007), pdf-file

  35. J. Fujisawa, L. Xiong, K. Yoshimoto and S. Zhang, The upper bound of the number of cycles in a 2-factor of a line graph, J. Graph Thoery 55, 72-82 (2007) pdf-file

  36. J. Fujisawa, K. Yoshimoto and S. Zhang, Heavy cycles passing through some specified vertices in weighted graphs*, J. Graph Theory 49, 93-103 (2005)


  37. A. Kaneko and K. Yoshimoto, A 2-factor with two components of a graph satisfying the Chvatal-Erdos condition, J. Graph theory 43, 269-279 (2003)

  38. A. Kaneko, Y. Oda and K. Yoshimoto, On geometric independency trees of the set of points in the plane*, Discrete Math. 258, 93-104 (2002)

  39. A. Kaneko, K. Kawarabayashi, K. Ota and K. Yoshimoto, On a hamiltonian cycle in which specified vertices are not isolated, Discrete Math. 258, 85-91 (2002)

  40. A. Kaneko and K. Yoshimoto, On a 2-Factor with a Specified Edge of a Graph Satisfying the Ore Condition, Discrete Math. 257, 445-461 (2002)

  41. K. Ando, A. Kaneko, K. Kawarabayashi and K. Yoshiomoto, Contractible edges and bowties in a k-connected graphs*, Ars Combin. 64, 239-247 (2002)


  42. A. Kaneko and K. Yoshimoto, The connectivities of leaf graphs of a set of points in general position in the plane, Tokyo J. Math., 24, 559-566 (2001)

  43. T. Nakamura and K. Yoshimoto, Transformation of spanning trees of a 2-connected graph*, Ars Combin. 60, 65-71, (2001)

  44. K. Yoshimoto, The connectivities of trunk graphs of 2-connected graphs, Ars Combin. 60, 225-237 (2001)

  45. A. Kaneko and K. Yoshimoto, On a Hamiltonian cycle in which specified vertices are uniformly distributed, J. Combin. Theory Ser. B 81, 100-109 (2001)

  46. A. Kaneko, M. Kano and K. Yoshimoto, Hamiltonian cycles with the minimum number of crossings in bipartite embedding of complete bipartite graphs*, Internat. J. Comput. Geom. Appl., 10, 73-78 (2000)

  47. A. Kaneko and K. Yoshimoto, On spanning trees with restricted degrees, Inform. Process. Lett. 73, 163-165 (2000)

  48. A. Kaneko and K. Yoshimoto, The connectivities of leaf graphs of 2-connected graphs, J. Combin. Theory Ser. B 76, 155-169 (1999)

Pending Papers
  1. B. Li, Z. Ryjacek and K. Yoshimoto, Heavy subgraphs for 2-factors of 2-connected graphs, preprint , pdf-file

  2. A. Saito and K. Yoshimoto, in Preparations

  3. A. Kaneko, K. Kawarabayashi, A. Nakamoto, K. Ota and K. Yoshimoto, 2-Connected spanning subgraphs of small size in circuit graphs, preprint

  4. H.J. Broersma, K. Yoshimoto and S. Zhang, Degree conditions and a dominating longest cycle, preprint, pdf-file

  5. K. Yoshimoto, Relative length and a cycle through vertices on a path, preprint

  6. A. Kaneko and K. Yoshimoto, On longest cycles in a 2-connected balanced bipartite graph with Ore type condition, I, preprint, pdf-file

Proceeding and Memoranda
  1. K. Yoshimoto, Hamiltonian cycles of certain kinds of graphs satisfying Dirac condition. 6th International Conference on Graph Theory (Marseille, 2000), Electron. Notes Discrete Math., 5

  2. A. Kaneko and K. Yoshimoto, A 4-cycle and a 2-factor with two components of a graph satisfying the Chvatal-Erdos condition*, 6th International Conference on Graph Theory (Marseille, 2000), Electron. Notes Discrete Math., 5

  3. A. Kaneko and K. Yoshimoto, On spanning trees with restricted degrees. (Extended abstract) Paul Erdos and his mathematics (Budapest, 1999), 116--117