List of Papers




Submitted Papers
  1. List orientation number of graphs, submitted. (with T. Abe)   pdf file
  2. A large k-tree in graphs of bounded maximum degree and in star-free graphs, submitted. (with T. Sugiyama)   pdf file
Accepted Papers
  1. An even 2-factor in the line graph of a cubic graph, to appear in Theory and Applications of Graphs. (with SeungJae Eom)   pdf file
  2. Kempe equivalence classes of cubic graphs embedded on the projective plane, to appear in Combinatorica.   pdf file
  3. Signatures of edge-colorings on the projective plane, to appear in Yokohama Math. J. (with T. Abe)
Published Papers
  1. Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- A survey, Lecture Notes in Computer Science 13034 (2021) 74--95.   pdf file
  2. The Alon-Tarsi number of K_5-minor-free graphs, Discrete Math. 345 (2022) 112764. (with T. Abe and S.J. Kim)   arXiv
  3. Covering projective planar graphs with three forests, Discrete Math. 345 (2022) 112748. (with R. Mukae, T. Sano and R. Tazume)
  4. A forbidden pair for connected graphs to have spanning k-trees, J, Graph Theory 99 (2022) 509--520. (with S. Maezawa)   pdf file
  5. Proper colorings of plane quadrangulations without rainbow faces, Graphs Combin. 37 (2021) 1873--1890. (K. Enami, and T. Yamaguchi)   pdf file
  6. Color number of cubic graphs having spanning tree with bounded number of leaves, Theory and Applications of Graphs, 8 (2021) Article 1. (A.A. Malnegro, and G.A. Malacas)   pdf file
  7. Single]conflict colouring J. Graph Thoery. 97 (2021) 148--160. (with Z. Dvorak, L. Esperet, and R.J. Kang)   pdf file
  8. 2-Factors of cubic bipartite graphs, Discrete Math. 344 (2021) 112357 (with N. Haghparast)   pdf file
  9. A Note on Enumeration of 3-Edge-Connected Spanning Subgraphs in Plane Graphs, IEICE TRANS. INF. \& SYST., E104-D, NO.3 2021. (with Y. Matsui)
  10. On minimum leaf spanning trees and a criticality notion, Discrete Math. 343 (2020) 111884 (with G. Wiener, and C. Zamfirescu)
  11. Thomassen's conjecture for line graphs of 3-hypergraphs, Discrete Math. 343 (2020) 111838. (with B. Li, Z. Ryjacek, and P. Vrana)   pdf file
  12. Orientations of graphs avoiding given lists on out-degrees, J. Graph Theory 93 (2020) 483--502. (with S. Akbari, M. Dalirrooyfard, K. Ehsani and R. Sherkati)   pdf file
  13. Long paths in bipartite graphs and path-bistar bipartite Ramsey numbers, Graphs Combin. 36 (2020) 167--176. (with M. Furuya, and S. Maezawa)
  14. Extension to 3-colorable triangulations, SIAM J. Discrete Math. 33 (2019) 1390--1414. (with A. Nakamoto, and K. Noguchi)   pdf file
  15. Book embedding of graphs on the projective plane, SIAM J. Discrete Math. 33 (2019) 1801--1836. (with A. Nakamoto, and T. Nozawa)   pdf file
  16. A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity, Electronic J. Combin 26 (2019) # P4.53. (with S. Chiba, M. Furuya, M. Tsugaki and T. Yamashita)   journal page
  17. A complete bipartite graph without properly colored cycles of length four, J. Graph Theory 93 (2020) 168--180. (with R. Cada, and K. Yoshimoto)   pdf file
  18. On the minimum leaf number of cubic graphs, Discrete Math. 342 (2019) 3000-3005 (with J. Goedgebeur, N. Van Cleemput, and G. Wiener)   pdf file
  19. Types of triangle and the impact on domination and k-walks, Ars Mathematica Contemporanea 17 (2019) 51--66. (with G. Brinkmann, and N.V. Cleemput)
  20. A note on a Brooks' type theorem for DP-coloring, J. Graph Theory 91 (2019) 148--161. (with S.J. Kim)   arxiv: 1709.09807
  21. Hamiltonicity of planar graphs with a forbidden minor, J. Graph Theory 90 (2019) 459--483. (with M.N. Ellingham, E.A. Marshall, and S. Tsuchiya)   arxiv: 1610.06558
  22. [a, b]-Factors of graphs on surfaces, Discrete Math. 342 (2019) 1979--1988. (with R. Matsubara, H. Matsuda, N. Matsuo, and K. Noguchi)   pdf file
  23. Connected Odd Factors of Graphs, Australasian J. Combin. 73 (2019) 200--206. (with N. Haghparast, M. Kano, and S. Maezawa)   pdf file
  24. Spanning bipartite quadrangulations of even triangulations, J. Graph Theory 90 (2019) 267--287. (with A. Nakamoto, and K. Noguchi)   pdf file
  25. Highly edge-connected factors using given lists on degrees, J. Graph Theory 90 (2019) 150--159. (with S. Akbari and M. Hasanvand)
  26. A new approach towards a conjecture on intersecting three longest paths, J. Combin. Theory. 10 (2019) 221--234. (with S. Fujita, M. Furuya, and R. Naserasr)   arxiv: 1503.01219
  27. Every 4-connected graph with crossing number 2 is hamiltonian, SIAM J. Discrete Math. 32 (2018) 2783--2794. (with C. Zamfirescu)   pdf file
  28. On upper bounds for the independent transversal domination number Discrete Appl. Math. 236 (2018) 66--72. (with C. Brause, M. Henning, I. Schiermeyer and E. Vumar)
  29. Hamiltonian properties of polyhedra with few 3-cuts - A survey, Discrete Math. 341 (2018) 2646--2660. (with N.V. Cleemput, and C.T. Zamfirescu)
  30. 3-dynamic coloring of planar triangulations, Discrete Math. 341 (2018) 2988--2994. (with Y. Asayama, Y. Kawasaki, S.J. Kim and A. Nakamoto)   pdf file
  31. On Homeomorphically Irreducible Spanning Trees in Cubic Graphs, J. Graph Theory 89 (2018) 93--100. (with A. Hoffmann-Ostenhof and K. Noguchi)   pdf file
  32. Non-hamiltonian triangulations with distant separating triangles, Discrete Math. 341 (2018) 1900--1902. (with C. Zamfirescu)   pdf file
  33. A Sufficient condition for DP-4-colorability, Discrete Math. 341 (2018) 1983--1986. (with S.J. Kim)
  34. Sufficient conditions for the existence of a path-factor which are related to odd components, J. Graph Theory 89 (2018) 327--340. (with Y. Egawa, and M. Furuya)   arxiv: 1705.08592
  35. Decomposing planar cubic graphs, J. Graph Theory 88 (2018) 631--640. (with A. Hoffmann-Ostenhof and T. Kaiser)   arxiv: 1609.05059
  36. Pairs of forbidden subgraphs and 2-connected supereulerian graphs, Discrete Math. 341 (2018) 1696--1707. (with R. Cada, L. Xiong and K. Yoshimoto)   pdf file
  37. Grunbaum colorings of even triangulations on surfaces, J. Graph Theory 87 (2018) 475--491. (with M. Kotrbcik, N. Matsumoto, B. Mohar, A. Nakamoto, K. Noguchi, and A. Vodopivec)   pdf file
  38. Plane triangulations without spanning Halin subgraphs II, SIAM J. Discrete Math. 31 (2017) 2429--2439. (with G. Chen, H. Enomoto, and S. Tsuchiya)   pdf file
  39. On dominating even subgraphs in cubic graphs, SIAM J. Discrete Math. 31 (2017) 890--907. (with R. Cada, S. Chiba, and K. Yoshimoto)   pdf file
  40. On two conjectures about the proper connection number of graphs, Discrete Math. 340 (2017) 2217--2222. (with F. Huang, X. Li, Z. Qin and C. Magnant)   pdf file
  41. Coloring of locally planar graphs with one color class small, Australasian J. Combin. 67 (2017) 101--118. (with A. Nakamoto)   journal page
  42. Matching extension missing vertices and edges in triangulations of surfaces, J. Graph Theory 85 (2017) 249--257. (with K. Kawarabayashi and M.D. Plummer)   pdf file
  43. A characterization of $K_{2,4}$-minor-free graphs, SIAM J. Discrete Math. 30 (2016) 955--975. (with M.N. Ellingham, E.A. Marshall, and S. Tsuchiya)   arxiv: 1409.4632
  44. Cyclic 4-colorings of graphs on surfaces, J. Graph Theory 82 (2016) 265--278. (with A. Nakamoto, and K. Noguchi)   pdf file
  45. 5-connected toroidal graphs are Hamiltonian-connected, SIAM J. Discrete Math. 30 (2016) 112--140. (with K. Kawarabayashi)   pdf file
  46. $m$-dominating $k$-trees of graphs, Discrete Math. 339 (2016) 729--736. (with M. Kano, M. Tsugaki, and G. Yan)   pdf file
  47. Decomposing plane cubic graphs, European J. Combin. 52A (2016) 40--46. (with D. Ye)   pdf file
  48. Extension to even triangulations, SIAM J. Discrete Math. 29 (2015) 2075--2087. (with A. Nakamoto, and K. Noguchi)   pdf file
  49. Plane triangulations without spanning Halin subgraphs : Counterexamples of Lovasz-Plummer conjecture on Halin graphs, SIAM J. Discrete Math. 29 (2015) 1423--1426. (with G. Chen, H. Enomoto, and S. Tsuchiya)   pdf file
  50. Equivalence of Jackson's and Thomassen's conjectures, J. Combin. Theory Ser. B 114 (2015) 124--147. (with R. Cada, S. Chiba, P. Vrana and K. Yoshimoto)   pdf file
  51. Spanning trees with vertices having large degrees, J. Graph Theory 79 (2015) 213--221. (with Y. Egawa)   pdf file
  52. A toughness condition for a spanning tree with bounded total excesses, Graphs and Combin. 31 (2015) 1679--1688.   pdf file
  53. Spanning $k$-forests with large components in $K_{1,k+1}$-free graphs, Graphs and Combin. 31 (2015) 1659--1677. (with T. Sugiyama)   pdf file
  54. The existence of semi-colorings in a graph, Graphs and Combin. 31 (2015) 1397--1401. (with M. Furuya, and M. Kamada)
  55. The chromatic index of a claw-free graph whose core has maximum degree 2, Graphs and Combin. 31 (2015) 805--811. (with S. Akbari and M. Ghanbari)
  56. 4-connected projective-planar graphs are hamiltonian-connected, J. Combin. Theory Ser. B 112 (2015) 36--69. (with K. Kawarabayashi)   pdf file
  57. Every 5-connected planar triangulation is 4-ordered Hamiltonian, J. Algebra Combin. Discrete Structures and Applications 2 (2015) 37--42.   pdf file
  58. A shorter proof of Thomassen's theorem on Tutte paths in plane graphs, SUT J. Math. 50 (2014) 417--425.   pdf file
  59. ${0,2}$-degree free spanning forests in graphs, Discrete Math. 338 (2015) 1226--1231. (with S. Akbari, A. Rezei, R. Rotabi and S. Sabour)   pdf file
  60. 2-factors with bounded number of components in claw-free graphs, Discrete Math. 338 (2015) 793--808. (with Z. Ryjacek and K. Yoshimoto)   pdf file
  61. Spanning k-trees of bipartite graphs, Electron. J. Combin. 22 (2015) #P1.13. (with M. Kano, K. Suzuki, M. Tsugaki and T. Yamashita)   journal page
  62. A relationship between Thomassen's conjecture and Bondy's conjecture, SIAM J. Discrete Math. 29 (2015) 26--35. (with R. Cada, S. Chiba, P. Vrana and K. Yoshimoto)   pdf file
  63. Spanning closed walks and TSP in 3-connected planar graphs, J. Combin. Theory Ser. B 109 (2014) 1-33. (with K. Kawarabayashi)   pdf file
  64. On the ratio of the domination number and the independent domination number in graphs, Discrete Appl. Math. 178 (2014) 157--159. (with M. Furuya, and A. Sasaki)   pdf file
  65. A sufficient and necessary condition for the existence of a spanning tree with specified vertices having large degrees, Combinatorica 34 (2014) 47--60. (with Y. Egawa)   pdf file
  66. Improved upper bounds for Gallai-Ramsey numbers of paths and cycles, J. Graph Theory 75 (2014) 59--74. (with M. Hall, C. Magnant and M. Tsugaki)   pdf file
  67. Spanning trees with a bounded number of branch vertices in a claw-free graph, Graphs and Comin. 30 (2014) 429--437. (with H. Matsuda and T. Yamashita)   pdf file
  68. 2-edge-Hamiltonian-connectedness of 4-connected plane graphs, Europ. J. Combin. 35 (2014) 432--448. (with P. Vrana)   pdf file
  69. Forbidden subgraphs generating almost the same sets, Combin. Probab. Comput. 22 (2013) 733--748. (with S. Fujita and M. Furuya)   pdf file
  70. A simpler proof for the two disjoint odd cycles theorem, J. Combin. Theory Ser. B 103 (2013) 313--319. (with K. Kawarabayashi)   pdf file
  71. Spanning trees with bounded maximum degrees of graphs on surfaces, SIAM J. Discrete Math. 27 (2013) 422--435.   pdf file
  72. {4,5} is not coverable: a counterexample to Kaiser-Skrekovski conjecture, SIAM J. Discrete Math. 27 (2013) 141--144. (with R. Cada, S. Chiba, P. Vrana and K. Yoshimoto)   pdf file
  73. Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices, J. Combin. Theory Ser. B 103 (2013) 46--60. (with J. Fujisawa and A. Nakamoto)   pdf file
  74. Forbidden induced subgraphs for near perfect matchings, Discrete Math. 313 (2013) 1267--1280. (with K. Ota and G. Sueiro)
  75. Spanning trees in 3-connected $K_{3,t}$-minor-free graphs, J. Combin. Theory Ser. B 102 (2012) 1179--1188. (with K. Ota)   pdf file
  76. Book embedding of toroidal bipartite graphs, SIAM J. Discrete Math 26 (2012) 661--669. (with A. Nakamoto and K. Ota)   pdf file
  77. Hamiltonian cycles in bipartite quadrangulations on the torus, J. Graph Theory 69 (2012) 143--151. (with A. Nakamoto)   pdf file
  78. Claw-free graphs and 2-factors that separate independent vertices, J. Graph Theory 69 (2012) 251--263. (with R.J. Faudree, C. Magnant and K. Yoshimoto)   pdf file
  79. 2-factors and independent sets on claw-free graphs, Discrete Math 312 (2012) 202--206. (with R. Kuzel and K. Yoshimoto)   pdf file
  80. Length of longest cycles in a graph whose relative length is at least two, Graphs and Comin. 28 (2012) 859--868. (with T. Yamashita)   pdf file
  81. Partitioning graphs into paths and cycles, Journal of Combinatorics 3 (2012) 135--161. (with C. Magnant)   pdf file
  82. Spanning trees with small number of leaves in a claw-free graph, Ars Combinatoria 103 (2012) 137--154. (with M. Kano, A. Kyaw, H. Matsuda, A. Saito and T. Yamashita)   pdf file
  83. 2- and 3-factors of graphs on surfaces, J. Graph Theory 67 (2011) 306--315. (with K. Kawarabayashi)   pdf file
  84. Forbidden induced subgraphs for star-free graphs, Discrete Math. 311 (2011) 2475--2484. (with J. Fujisawa, K. Ota and G. Sueiro)   pdf file
  85. A note on total excess of spanning tree, AKCE International Journal of Graphs and Combinatorics 8 (2011) 97--103. (with Y. Ohnishi and K. Ota)   pdf file
  86. Dominating cycles in triangle-free graphs, Ars Combinatria 98 (2011) 173--182. (with T. Yamashita)   pdf file
  87. Spanning trees -- A survey, Graphs and Comin. 27 (2011) 1--26. (with T. Yamashita)   pdf file
  88. Non-separating subgraphs after deleting many disjoint paths, J. Combin. Theory Ser. B 101 (2011) 54--59. (with K. Kawarabayashi)   pdf file
  89. The independence number condition for the existence of a spanning $f$-tree, J. Graph Theory 65 (2010) 173--184. (with H. Enomoto)   pdf file
  90. 4-connected triangulations and 4-orderedness, Discrete Math. 310 (2010) 2271--2272. (with R. Mukae)   pdf file
  91. A simple algorithm for 4-coloring 3-colorable planar graphs, Theoretical Computer Science 411 (2010) 2619--2622. (with K. Kawarabayashi)   pdf file
  92. Set-orderedness as a generalization of $k$-orderedness and cyclability, Discrete Math. 310 (2010) 2310--2316. (with K. Ishii and K. Yoshimoto)   pdf file
  93. A spanning tree with high degree vertices, Graphs Combin. 26 (2010) 591--596. (with T. Yamashita)   pdf file
  94. Rainbow generalizations of Ramsey theory: a survey, Graphs Combin. 26 (2010) 1--30. (with S. Fujita and C. Magnant)
  95. A $k$-tree containing specified vertices, Graphs Combin. 26 (2010) 187--205. (with S. Chiba, R. Matsubara and M. Tsugaki)
  96. A degree sum condition for graphs to be prism hamiltonian, Discrete Math. 309 (2009) 4266--4269.
  97. On relative length of longest paths and cycles, J. Graph Theory 62 (2009) 279--291. (with M. Tsugaki and T. Yamashita)
  98. Hamilton cycles and dominating cycles passing through a linear forest, Discrete Math. 309 (2009) 1584--1592. (with T. Yamashita)
  99. Long cycles in graphs without hamiltonian paths, Discrete Math. 308 (2008) 5899--5906. (with K. Kawarabayashi and T. Yamashita)
  100. A degree sum condition concerning the connectivity and the independence number of a graph, Graphs and Combin. 24 (2008) 469--483. (with T. Yamashita)
  101. A note on a longest cycle which is vertex dominating, AKCE International Journal of Graphs and Combinatorics 4 (2007) 233--243. (with H. Matsumura and T. Sugiyama)
Refereed Conference Proceedings
  1. 4-connected projective-planar graphs are hamiltonian-connected, to appear in Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 2013 378--395. (with K. Kawarabayashi)
  2. Spanning closed walks and TSP in 3-connected planar graphs, Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), 2012 671--682. (with K. Kawarabayashi)
  3. Hamilton cycles in $4$-connected triangulations of the torus, Proceeding of Eurocomb 11', Electronic Notes on Discrete Mathematics 38 (2011) 493--498. (with K. Kawarabayashi)
  4. Prism hamiltonicity of $3$-connected plane graphs with minimum degree at least $4$, Proceedings of the 7th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, 2011.
  5. Spanning trees in $3$-connected $K_{3,t}$-minor-free graphs, Proceeding of Eurocomb 09', Electronic Notes on Discrete Mathematics 34 (2009) 145--149. (with K. Ota)

Back