List of Publications

  1. Some conditions for hamiltonian cycles in 1-tough K2∪kK1-free graphs. (with Masahiro Sanka)
    Discrete Math. 347 (2024), 113841, 6pp.

  2. Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two. (with Shuya Chiba, Tomoki Yamashita)
    J. Graph Theory 103 (2023), 340--358.

  3. Hamiltonian cycles in 2-tough 2K2-free graphs. (with Masahiro Sanka)
    J. Graph Theory 101 (2022), 769--781.

  4. Graph grabbing game on totally-weighted graphs. (with Naoki Matsumoto, Ryusei Moriyama)
    Discrete Appl. Math. 322 (2022), 384--390.

  5. Color degree sum conditions for properly colored spanning trees in edge-colored graphs. (with Mikio Kano, Shun-ichi Maezawa, Masao Tsugaki, Takamawa Yashima)
    Discrete Math. 343 (2020), 112042, 5pp.

  6. Hadwiger's conjecture for degree sequences. (with Guantao Chen)
    J. Combin. Theory Ser. B 114 (2015), 247--249.

  7. Disjoint chorded cycles of the same length. (with Guantao Chen, Ronald J. Gould, Kazuhide Hirohata, Songling Shan)
    SIAM J. Discrete Math. 29 (2015), 1030--1041.

  8. Edge proximity conditions for extendability in planar triangulations. (with Jun Fujisawa)
    J. Graph Theory 80 (2015), 1--11.

  9. Maximal cycles in graphs of large girth. (with Jun Fujisawa)
    SUT J. Math. 50 (2014), 427--438.

  10. Forbidden induced subgraphs for near perfect matchings. (with Kenta Ozeki and Gabriel Sueiro)
    Discrete Math. 313 (2013), 1267--1280.

  11. Forbidden induced subgraphs for toughness. (with Gabriel Sueiro)
    J. Graph Theory 73 (2013), 191--202.

  12. Forbidden induced subgraphs for perfect matchings. (with Gabriel Sueiro)
    Graphs Combin. 29 (2013), 289--299.

  13. Book embedding of toroidal bipartite graphs. (with Atsuhiro Nakamoto and Kenta Ozeki)
    SIAM J. Discrete Math. 26 (2012), 661--669.

  14. Spanning trees in 3-connected K3,t-minor-free graphs. (with Kenta Ozeki)
    J. Combin. Theory Ser. B 102 (2012), 1179--1188.

  15. Maximal K3's and Hamiltonicity of 4-connected claw-free graphs. (with Jun Fujisawa)
    J. Graph Theory 70 (2012), 40--53.

  16. Hamiltonian cycles with all small even chords. (with Guantao Chen, Akira Saito and Yi Zhao)
    Discrete Math. 312 (2012), 1226--1240.

  17. Forbidden induced subgraphs for star-free graphs. (with Jun Fujisawa, Kenta Ozeki and Gabriel Sueiro)
    Discrete Math. 311 (2011), 2475--2484.

  18. Spanning trees with bounded total excess. (with Hikoe Enomoto and Yukichika Ohnishi)
    Ars Combin. 102 (2011), 289--295.

  19. The existence of a 2-factor in K1,n-free graphs with large connectivity and large edge-connectivity. (with R. E.L. Aldred, Yoshimi Egawa, Jun Fujisawa and Akira Saito)
    J. Graph Theory 68 (2011), 77--89.

  20. Toughness of Ka,t-minor-free graphs. (with Guantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi and Bojan Mohar)
    Electron. J. Combin. 18 (2011), #P148, 6 pp.

  21. Forbidden triples for perfect matchings. (with Michael D. Plummer and Akira Saito)
    J. Graph Theory 67 (2011), 250--259.

  22. A note on total excess of spanning trees. (with Yukichika Ohnishi)
    AKCE Int. J. Graphs Combin. 8 (2011), 97--103.

  23. N-flips in even triangulations on the torus and Dehn twists preserving monodromies. (with Yusuke Higuchi, Atsuhiro Nakamoto and Tadashi Sakuma)
    Discrete Math. 311 (2011), 1128--1135.

  24. Forbidden subgraphs and the existence of spanning k-trees. (with Takeshi Sugiyama)
    Discrete Math. 310 (2010), 3506--3511.

  25. 3-Trees with a few vertices of degree 3 in circuit graphs. (with Atsuhiro Nakamoto and Yoshiaki Oda)
    Discrete Math. 309 (2009), 666--672.

  26. On 2-factors in r-connected {K1,k,P4}-free graphs. (with Yoshimi Egawa, Jun Fujisawa and Shinya Fujita)
    Tokyo J. Math. 31 (2008), 415--420.

  27. Forbidden subgraphs and the existence of paths and cycles passing through specified vertices. (with Jun Fujisawa, Katsuhiro Ota, Takeshi Sugiyama and Masao Tsugaki)
    Discrete Math. 308 (2008), 6111--6114.

  28. K1,3-Factors in graphs. (with Yoshimi Egawa and Shinya Fujita)
    Discrete Math. 308 (2008), 5965--5973.

  29. K6-Minors in triangulations on the double torus. (with Atsuhiro Nakamoto and Yoshiaki Oda)
    Congr. Numer. 188 (2007), 150--160.

  30. The Chvátal-Erdös condition and 2-factors with a specified number of components. (with Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Akira Saito and Ingo Schiermeyer)
    Discuss. Math. Graph Theory 27 (2007), 401--407.

  31. Independence number and vertex-disjoint cycles. (with Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendroľ and Ingo Schiermeyer)
    Discrete Math. 307 (2007), 1493--1498.

  32. A pair of forbidden subgraphs and perfect matchings. (with Shinya Fujita, Ken-ichi Kawarabayashi, Claudio L. Lucchesi, Michael D. Plummer and Akira Saito)
    J. Combin. Theory Ser. B 96 (2006), 315--324.

  33. Weighted Ramsey problem. (with J. Fujisawa)
    Australas. J. Combin. 34 (2006), 331--342.

  34. A Ore-type degree condition for heavy paths in weighted graphs. (with Hikoe Enomoto and Jun Fujisawa)
    Discrete Math. 300 (2005), 100--109.

  35. A σk type condition for heavy cycles in weighted graphs. (with Hikoe Enomoto and Jun Fujisawa)
    Ars Combin. 76 (2005), 225--232.

  36. On 3-coloring of plane triangulations. (with Atsuhiro Nakamoto and Mamoru Watanabe)
    Ars Combin. 75 (2005), 157--162.

  37. Planar triangulations which quadrangulate other surfaces. (with Atsuhiro Nakamoto, Seiya Negami and Jozef Širáň)
    European J. Combin. 25 (2004), 817--833.

  38. Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces. (with Atsuhiro Nakamoto and Seiya Negami)
    Disrete Math. 285 (2004), 211--218.

  39. On minimally 3-connected graphs on a surface.
    AKCE Internat. J. Graphs Combin. 1 (2004), 29--33.

  40. Vertex-disjoint cycles containing specified vertices in a bipartite graph. (with Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Dingjun Lou and Akira Saito)
    J. Graph Theory 46 (2004), 145--166.

  41. Subgraphs of graphs on surfaces with high representativity. (with Ken-ichi Kawarabayashi, Atsuhiro Nakamoto)
    J. Combin. Theory Ser. B 89 (2003), 207--229.

  42. Diagonal flips in Hamiltonian triangulations on the sphere. (with Ryuichi Mori, Atsuhiro Nakamoto)
    Graphs Combin. 19 (2003), 413--418.

  43. 2-Connected 7-coverings of 3-connected graphs on surfaces. (with Ken-ichi Kawarabayashi, Atsuhiro Nakamoto)
    J. Graph Theory 43 (2003), 26--36.

  44. On a hamiltonian cycle in which specified vertices are not isolated. (with Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshimoto)
    Discrete Math. 258 (2002), 85--91.

  45. On separable self-complementary graphs. (with Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yoshiaki Oda, Shinsei Tazawa, Mamoru Watanabe)
    Discrete Math. 257 (2002), 165--168.

  46. Hamiltonian cycles in n-extendable graphs. (with Ken-ichi Kawarabayashi, Akira Saito)
    J. Graph Theory 40 (2002), 75--82.

  47. Path factors in cubic graphs. (with Ken-ichi Kawarabayashi, Haruhide Matsuda, Yoshiaki Oda)
    J. Graph Theory 39 (2002), 188--193.

  48. The diameter of some transition graphs constructed from Hamilton cycles. (with Mariko Hagita, Yoshiaki Oda)
    Graphs Combin. 18 (2002), 105--117.

  49. Choice number of some complete multi-partite graphs. (with Hikoe Enomoto, Kyoji Ohba, Junko Sakamoto)
    Discrete Math. 244 (2002), 55--66.

  50. Vertex-disjoint stars in graphs.
    Discuss. Math. Graph Theory 21 (2001), 179--185.

  51. Vertex-disjoint paths in graphs. (with Yoshimi Egawa)
    Ars Combin. 61 (2001), 23--31.

  52. Hamiltonian cycles in n-factor-critical graphs. (with Ken-ichi Kawarabayashi, Akira Saito)
    Discrete Math. 240 (2001), 71--82.

  53. Chromatic numbers of quadrangulations on closed surfaces. (with Dan Archdeacon, Joan Hutchinson, Atsuhiro Nakamoto, Seiya Negami)
    J. Graph Theory 37 (2001), 100--114.

  54. Algorithmic aspects of pyramidal tours with restricted jump-backs. (with Yoshiaki Oda)
    Interdiscip. Inform. Sci. 7 (2001), 123--133.

  55. Vertex-disjoint cycles containing specified edges in a bipartite graph. (with Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Dingjun Lou, Akira Saito)
    Australas. J. Combin. 23 (2001), 37--48.

  56. On minimally (n,λ)-connected graphs. (with Atsushi Kaneko)
    J. Combin. Theory Ser. B 80 (2000), 156--171.

  57. Partitions of a graph into paths with prescribed endvertices and lengths. (with Hikoe Enomoto)
    J. Graph Theory 34 (2000), 163--169.

  58. Graph decompositions and D3-paths with a prescribed endvertex. (with Hikoe Enomoto, Shinsuke Matsunaga)
    Discrete Math. 213 (2000), 87--104.

  59. Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph. (with Hikoe Enomoto, Miki Shimabara Miyauchi)
    Discrete Appl. Math. 92 (1999), 149--155.

  60. Graph decompositions into connected subgraphs. (with Shinsuke Matsunaga)
    Proceedings of the Eighth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithm, and Applications, Western Michigan University, New Issues Press, (1999), 625--629.

  61. Connected subgraphs with small degree sums in 3-connected planar graphs. (with Hikoe Enomoto)
    J. Graph Theory 30 (1999), 191--203.

  62. Vertex-disjoint claws in graphs. (with Yoshimi Egawa)
    Discrete Math. 197/198 (1999), 225--246.

  63. Pyramidal tours with step-backs and the asymmetric traveling salesman problem. (with Hikoe Enomoto, Yoshiaki Oda)
    Discrete Appl. Math. 87 (1998), 57--65.

  64. Uniform intersecting families with covering number restrictions. (with Peter Frankl, Norihide Tokushige)
    Combin. Probab. Comput. 7 (1998), 47--56.

  65. Every graph is an integral distance graph in the plane. (with Hiroshi Maehara, Norihide Tokushige)
    J. Combin. Theory Ser. A 80 (1997), 290--294.

  66. On the pagenumber of complete bipartite graphs. (with Hikoe Enomoto, Tomoki Nakamigawa)
    J. Combin. Theory Ser. B 71 (1997), 111--120.

  67. Diagonal transformations of graphs and Dehn twists of surfaces. (with Atsuhiro Nakamoto)
    J. Combin. Theory Ser. B 70 (1997), 292--300.

  68. Three-cycle reversions in oriented planar triangulations. (with Atsuhiro Nakamoto, Takayuki Tanuma)
    Yokohama Math. J. 44 (1997), 123--139.

  69. Diagonal transformations in quadrangulations and Dehn twists preserving cycle parities. (with Atsuhiro Nakamoto)
    J. Combin. Theory Ser. B 69 (1997), 125--141.

  70. Long cycles passing through a specified edge in a 3-connected graph. (with Hikoe Enomoto, Kazuhide Hirohata)
    J. Graph Theory 24 (1997), 275--279.

  71. Connected spanning subgraphs of 3-connected planar graphs. (with Hikoe Enomoto, Tadashi Iida)
    J. Combin. Theory Ser. B 68 (1996), 314--323

  72. Exponents of uniform L-systems. (with Peter Frankl, Norihide Tokushige)
    J. Combin. Theory Ser. A 75 (1996), 23--43.

  73. Polynomial invariants of graphs II. (with Seiya Negami)
    Graphs Combin. 12 (1996), 189--198.

  74. A degree condition for the existence of regular factors in K1,n-free graphs. (with Taro Tokuda)
    J. Graph Theory 22 (1996), 59--64.

  75. Covers in uniform intersecting families and a counterexample to a conjecture of Lovasz. (with Peter Frankl, Norihide Tokushige)
    J. Combin. Theory Ser. A 74 (1996), 33--42.

  76. Cycles through prescribed vertices with large degree sum.
    Discrete Math. 145 (1995), 201--210.

  77. Non-contractible edges in a 3-connected graph. (with Yoshimi Egawa, Akira Saito, Xingxing Yu)
    Combinatorica 15 (1995), 357--364.

  78. Note on irreducible triangulations of surfaces. (with Atsuhiro Nakamoto)
    J. Graph Theory 20 (1995), 227--233.

  79. Uniform intersecting families with covering number four. (with Peter Frankl, Norihide Tokushige)
    J. Combin. Theory Ser. A 71 (1995), 127--145.

  80. Contractible triples in 3-connected graphs. (with William McCuaig)
    J. Combin. Theory Ser. B 60 (1994), 308--314.

  81. The 3-connected graphs having a longest cycle containing only three contractible edges. (with R.E.L. Aldred, Robert L. Hemminger)
    J. Graph Theory 17 (1993), 361--371.

  82. 2-Factors, connectivity and graph minors. (with Nathaniel Dean)
    Contemp. Math. 147 (1993), 381--386.

  83. Almost no graphs are autographs. (with Kiyoshi Ando)
    Proceedings of the JSPS Workshop on Graph Theory and Combinatorics, Tokyo, Japan (1990), 1--11.

  84. Regular factors in K1,n-free graphs. (with Yoshimi Egawa)
    J. Graph Theory 15 (1991), 337--344.

  85. Longest cycles in 3-connected graphs contain three contractible edges. (with Nathaniel Dean, Robert L. Hemminger)
    J. Graph Theory 13 (1989), 17--21.

  86. Non-separating induced cycles in 3-connected graphs. (with Akira Saito)
    SCIENTIA Ser. A: Math. Sci. 2 (1988), 101--105.

  87. The number of contractible edges in 3-connected graphs.
    Graphs Combin. 4 (1988), 333--354.

  88. A sufficient condition for a bipartite graph to have a k-factor. (with Hikoe Enomoto, Mikio Kano)
    J. Graph Theory 12 (1988), 141--151.