Publications

Published / Accepted Papers

1. Ramsey-type problems on induced covers and induced partitions toward the Gyárfás-Sumner conjecture (with S. Chiba), J. Graph Theory, to appear.

2. Degree factors with red-blue coloring of regular graphs (with M. Kano), Electron. J. Combin. 31 (2024) #P1.40.

3. Factors with red-blue coloring of claw-free graphs and cubic graphs (with M. Kano), Graphs Combin. 39 (2023) #85.

4. Ramsey-type results for path covers and path partitions. II. Digraphs (with S. Chiba), Appl. Math. Comput. 458 (2023) 128205.

5. Note on fair game edge-connectivity of graphs (with N. Matsumoto, Y. Ohno and K. Ozeki), Discrete Appl. Math. 333 (2023) 132-135.

6. Factors of bi-regular bipartite graphs (with Y. Egawa and M. Kano), Discrete Appl. Math. 322 (2022) 268-272.

7. Ramsey-type results for path covers and path partitions (with S. Chiba), Electorn. J. Combin. 29 (2022) #P4.8.

8. Forbidden triples generating a finite set of graphs with minimum degree three (with Y. Egawa), Discrete Appl. Math. 320 (2022) 282-295.

9. Small domination-type invariants in random graphs (with T. Kawasaki), J. Comb. 13 (2022) 531–543.

10. Existence of a spanning tree having small diameter (with Y. Egawa and H. Matsumura), Discrete Math. 344 (2021) 112548.

11. A characterization of trees based on edge-deletion and its applications for domination-type invariants, Discrete Appl. Math. 299 (2021) 50-61.

12. A continuous generalization of domination-like invariants, J. Comb. Optim. 41 (2021) 905-922.

13. A characterization of 2-connected {K1,3,N3,1,1}-free non-Hamiltonian graphs (with S. Chiba), Discrete Math. 344 (2021) 112321.

14. Long paths in bipartite graphs and path-bistar bipartite Ramsey numbers (with S. Maezawa and K. Ozeki), Graphs Combin. 36 (2020) 167-176.

15. A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity (with S. Chiba, K. Ozeki, M. Tsugaki and T. Yamashita), Electron. J. Combin. 26 (2019) #P4.53.

16. Characterizing the difference between graph classes defined by forbidden pairs including the claw (with G. Chen, S. Shan, S. Tsuchiya and P. Yang), Graphs Combin. 35 (2019) 1459–1474.

17. A Ramsey-type theorem for the matching number regarding connected graphs (with I. Choi, R. Kim and B. Park), Discrete Math. 343 (2020) 111648.

18. Large homeomorphically irreducible trees in path-free graphs (with S. Tsuchiya), J. Graph Theory 93 (2020) 372-394.

19. Degree sum conditions for the existence of spanning k-trees in star-free graphs (with S. Maezawa, R. Matsubara, H. Matsuda, S. Tsuchiya and T. Yashima), Discuss. Math. Graph Theory 42 (2022) 5-13.

20. Forbidden subgraph generating almost all claw-free graphs with high connectivity (with M. Yokota), IEICE Trans. Fund. Electron. Commun. Comput. Sci. E102.A (2019) 987-993.

21. General upper bounds on independent k-rainbow domination (with S. Fujita and C. Magnant), Discrete Appl. Math. 258 (2019) 105-113.

22. Upper bounds on the locating chromatic number of trees (with N. Matsumoto), Discrete Appl. Math. 257 (2019) 338-341.

23. A note on domination 3-edge-critical planar graphs (with N. Matsumoto), Inform. Process. Lett. 142 (2019) 64-67.

24. A characterization of domination weak bicritical graphs with large diameter, Graphs Combin. 34 (2018) 1077-1088.

25. The existence of f-forests and f-trees in graphs (with T. Yashima), Discrete Appl. Math. 254 (2019) 113-123.

26. Forbidden subgraphs for constant domination number, Discrete Math. Theor. Comput. Sci. 20(1) (2018) #19.

27. A new approach towards a conjecture on intersecting three longest paths (with S. Fujita, R. Naserasr and K. Ozeki), J. Comb. 10 (2019) 221-234.

28. Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles (with Y. Egawa), Discrete Math. 341 (2018) 2276-2284.

29. Safe number and integrity of graphs (with S. Fujita), Discrete Appl. Math. 247 (2018) 398-406.

30. Sufficient conditions for the existence of a path-factor which are related to odd components (with Y. Egawa and K. Ozeki), J. Graph Theory 89 (2018) 327-340.

31. Upper bound on 3-rainbow domination in graphs with minimum degree 2 (with M. Koyanagi and M. Yokota), Discrete Optim. 29 (2018) 45-76.

32. On star-packings having a large matching (with Y. Egawa), Australas. J. Combin. 70 (2018) 336-339.

33. Bounds on the domination number of a digraph and its reverse, Filomat 32 (2018) 2517-2524.

34. Forbidden subgraphs for k vertex-disjoint stars (with N. Matsumoto), J. Comb. 9 (2018) 721-738.

35. The existence of a path-factor without small odd paths (with Y. Egawa), Electron. J. Combin. 25 (2018) #P1.40.

36. Monochromatic homeomorphically irreducible trees in 2-edge-colored complete graphs (with S. Tsuchiya), J. Comb. 9 (2018) 681-691.

37. Distance-restricted matching extendability of fullerene graphs (with M. Takatou and S. Tsuchiya), J. Math. Chem. 56 (2018) 606-617.

38. Vertex-addition strategy for domination-like invariants (with N. Matsumoto), Electron. J. Combin. 24 (2017) #P3.45.

39. A sufficient condition for large rainbow domination number (with J. Amjadi, N. Dehgardi and S.M. Sheikholeslami), Int. J. Comput. Math. Comput. Syst. Theory 2 (2017) 53-65.

40. Forbidden pairs with a common graph generating almost the same sets (with S. Chiba, J. Fujisawa and N. Ikarashi), Electron. J. Combin. 24 (2017) #P2.13.

41. The k-rainbow reinforcement numbers in graphs (with J. Amjadi, L. Asgharsharghi, N. Dehgardi, S.M. Sheikholeslami and L. Volkmann), Discrete Appl. Math. 217 (2017) 394-404.

42. Neighborhood-union condition for an [a,b]-factor avoiding a specified Hamiltonian cycle (with T. Yashima), Discrete Math. 340 (2017) 1419-1425.

43. The number of covers in intersecting families with covering number three (with M. Takatou), Ars Combin. 142 (2019) 293-327. 

44. Path-factors involving paths of order seven and nine (with Y. Egawa), Theory Appl. Graphs 3(1) (2016) #5.

45. Dominating cycles and forbidden pairs containing P5 (with S. Chiba and S. Tsuchiya), Graphs Combin. 32 (2016) 1773-1788.

46. Partitioning a graph into highly connected subgraphs (with V. Borozan, M. Ferrara, S. Fujita, Y. Manoussakis, N. Narayanan and D. Stolee), J. Graph Theory 82 (2016) 322-333.

47. Forbidden triples generating a finite set of 3-connected graphs (with Y. Egawa, J. Fujisawa, M.D. Plummer and A. Saito), Electron. J. Combin. 22 (2015) #P3.13.

48. Forbidden pairs and the existence of a dominating cycle (with S. Chiba and S. Tsuchiya), Discrete Math. 338 (2015) 2442-2452.

49. On the diameter of domination bicritical graphs, Australas. J. Combin. 62 (2015) 184-196.

50. Perfect matchings avoiding several independent edges in a star-free graph (with Y. Egawa), J. Graph Theory 82 (2016) 33-44.

51. Forbidden quadruplets generating a finite set of 2-connected graphs (with Y. Okubo), Discrete Math. 338 (2015) 1277–1283.

52. A characterization of P5-free graphs with a homeomorphically irreducible spanning tree (with J. Diemunsch, M. Sharifzadeh, S. Tsuchiya, D. Wang, J. Wise and E. Yeager), Discrete Appl. Math. 185 (2015) 71-78.

53. Claw-free and N(2,1,0)-free graphs are almost net-free (with S. Tsuchiya), Graphs Combin. 31 (2015) 2201-2205.

54. A note on total domination and 2-rainbow domination in graphs, Discrete Appl. Math. 184 (2015) 229-230.

55. Forbidden subgraphs and the existence of a 2-walk, Discrete Math. 333 (2014) 56-61.

56. On the ratio of the domination number and the independent domination number in graphs (with K. Ozeki and A. Sasaki), Discrete Appl. Math. 178 (2014) 157-159.

57. A note on the domination number of triangulations (with N. Matsumoto), J. Graph Theory 79 (2015) 83-85.

58. A note on covering edge colored hypergraphs by monochromatic components (with S. Fujita, A. Gyárfás and Á. Tóth), Electron. J. Combin. 21(2014) #P2.33.

59. General bounds on rainbow domination numbers (with S. Fujita and C. Magnant), Graphs Combin. 31 (2015) 601-613.

60. The existence of semi-colorings in a graph (with M. Kamada and K. Ozeki), Graphs Combin. 31 (2015) 1397-1401.

61. The connectivity of domination dot-critical graphs with no critical vertex, Discuss. Math. Graph Theory 34 (2014) 683–690.

62. Rainbow domination numbers on graphs with given radius (with S. Fujita), Discrete Appl. Math. 166 (2014) 115-122.

63. Forbidden subgraphs and the existence of a spanning tree without small degree stems (with S. Tsuchiya), Discrete Math. 313 (2013) 2206-2212.

64. Upper bounds on the diameter of domination dot-critical graphs with given connectivity, Discrete Appl. Math. 161 (2013) 2420-2426.

65. Forbidden subgraphs generating almost the same sets (with S. Fujita and K. Ozeki), Combin. Probab. Comput. 22 (2013) 733-748.

66. Forbidden triples containing a complete graph and a complete bipartite graph of small order (with Y. Egawa), Graphs Combin. 30 (2014) 1149-1162.

67. Covers in 5-uniform intersecting families with covering number three (with M. Takatou), Australas. J. Combin. 55 (2013) 249-262.

68. Difference between 2-rainbow domination and Roman domination in graphs (with S. Fujita), Discrete Appl. Math. 161 (2013) 806-812.

69. Partition of graphs and hypergraphs into monochromatic connected parts (with S. Fujita, A. Gyárfás and Á. Tóth), Electron. J. Combin. 19(3) (2012) #P27.

70. Upper bound on the diameter of a total domination vertex critical graph (with N. Kato), Ars Combin. 128 (2016) 349-371. 

71. Construction of (γ,k)-critical graphs, Australas. J. Combin. 53 (2012) 53-65.

72. k-rainbow domatic numbers (with S. Fujita and C. Magnant), Discrete Appl. Math. 160 (2012) 1104-1113.

73. Upper bounds on the paired domination subdivision number of a graph (with Y. Egawa and M. Takatou), Graphs Combin. 29 (2013) 843-856.

74. Upper bound on the diameter of a domination dot-critical graph (with M. Takatou), Graphs Combin. 29 (2013) 79-85.

75. Constructing connected bicritical graphs with edge-connectivity 2 (with X. Chen, S. Fujita and M.Y. Sohn), Discrete Appl. Math. 160 (2012) 488-493.

76. Covers in 4-uniform intersecting families with covering number three (with S. Chiba, R. Matsubara and M. Takatou), Tokyo J. Math. 35 (2012) 241-251.

Submitted Papers

1. Estimation of domination number of graphs via safe number (S. Fujita and P. Kaemawichanurat)

2. New invariants for partitioning a graph into 2-connected subgraphs (with M. Kashima and K. Ota)

3. A necessary and sufficient condition for the existence of a properly coloured f-factor in an edge-coloured graph (with R. Čada, K. Kimura, K. Ozeki, C. Purcell and T. Yashima)

4. Distribution of vertices required a high-degree condition on partitions of graphs under degree constraints (with S. Maezawa)

5. New strategy on the existence of a spanning tree without small degree stems (with S. Tsuchiya)

6. Refinements of degree conditions for the existence of a spanning tree without small degree stems (with A. Saito and S. Tsuchiya)

7. Forbidden subgraphs restricting vertices of degree two in a spanning tree (with S. Tsuchiya)

8. Forbidden subgraphs generating a finite set of graphs with minimum degree three and large girth (with Y. Egawa)

9. The uniqueness of covers for widely generalized line graphs (with S. Kubota, T. Taniguchi and K. Yoshino)

Preprints

1. An algebraic reduction of Hedetniemi's conjecture (with R. Fukasaku and A. Higashitani)

Contributed articles

1. 線形計画問題によるVizing予想へのアプローチ, オペレーションズ・リサーチ 2016年12月号, 公益社団法人 日本オペレーションズリサーチ学会

2. 辺の重み付けと1-2-3予想, グラフ理論の新展開, 数学セミナー 2014年1月号, 日本評論社

Last modified: June 8, 2024