Publications

Published/Accepted Papers

1. Game chromatic number of honeycomb related networks, M. Imran, S.A.U.H. Bokhary, M.S. Akhtar and N. Matsumoto, Communications in Combinatorics and Optimization, to appear.

2. Feedback game on 3-chromatic Eulerian triangulations of surfaces, A. Higashitani, K. Kurimoto and N. Matsumoto, Discrete Applied Mathematics 347 (2024), 30-38.

3. Cubic graphs having only k-cycles in each 2-factor, N. Matsumoto, K. Noguchi and T. Yashima, Discussiones Mathematicae Graph Theory 44 (2024), 281-296.

4. Graph grabbing game on graphs with forbidden subgraphs, M. Doki, Y. Egawa and N. Matsumoto, Discussiones Mathematicae Graph Theory 44 (2024), 171-197.

5. Feedback game on Eulerian graphs, N. Matsumoto and A. Nagao, Thai Journal of Mathematics 21 (2023), 751-768.

6. Bichromatic coloring game on triangulations, N. Matsumoto, RAIRO - Operations Research 57 (2023), 2929-2939.

7. Kempe equivalence of almost bipartite graphs, A. Higashitani and N. Matsumoto, Australasian Journal of Combinatorics 87 (2023), 203-213.

8. Note on fair game edge-connectivity of graphs, M. Furuya, N. Matsumoto, Y. Ohno and K. Ozeki, Discrete Applied Mathematics 333 (2023), 132-135.

9. Cache-Efficient Approach for Index-Free Personalized PageRank, K. Tsuchida, N. Matsumoto, A. Shin and K. Kaneko, IEEE Access 11 (2023), 6944-6957.

10. The ratio of the numbers of odd and even cycles in outerplanar graphs, A. Higashitani and N. Matsumoto, Discrete Mathematics 346 (2023), #113285.

11. Game chromatic number of strong product graphs, H. Enomoto, J. Fujisawa and N. Matsumoto, Discrete Mathematics 346 (2023), #113162.

12. Graph grabbing game on totally-weighted graphs, N. Matsumoto, R. Moriyama and K. Ota, Discrete Applied Mathematics 322 (2022), 384-390.

13. Characterization of outerplanar graphs with equal 2-domination and domination numbers, N. Matsumoto, Theory and Applications of Graphs 9-(2) (2022), Article #1.

14. Domatically full Cartesian product graphs, S. Hiranuma, G. Kawatani and N. Matsumoto, Asian-European Journal of Mathematics 15 (2022), #2250157

15. A note on avoidance games on Steiner triple systems, N. Matsumoto, K. Momihara and M. Nakamura, Australasian Journal of Combinatorics 83 (2022), 196-203.

16. Uniquely colorable graphs with equal chromatic and game chromatic numbers, N. Matsumoto, Discrete Mathematics, Algorithms and Applications 14 (2022), #2150119.

17. Peg solitaire on graphs with large maximum degree, N. Matsumoto, Asian-European Journal of Mathematics 15 (2022), #2250057.

18. Rainbow perfect and near-perfect matchings in complete graphs with edges colored by circular distance, S. Saitoh, W. Wu and N. Matsumoto, Theory and Applications of Graphs 9-(1) (2022), Article #9.

19. Facial achromatic number of triangulations with given guarding number, N. Matsumoto and Y. Ohno, Theory and Applications of Graphs 9(1) (2022), Article #1.

20. Balanced polychromatic 2-coloring of triangulations, Y. Asayama and N. Matsumoto, Graphs and Combinatorics 38 (2022), Article #16.

21. The minimum number of vertices of graphs containing two monochromatic triangles for any edge 2-coloring, N. Matsumoto, M. Yamamoto and M. Yamazaki, Australasian Journal of Combinatorics 81 (2021), 208-232.

22. Achromatic number and facial achromatic number of connected locally-connected graphs, N. Matsumoto and Y. Ohno, Discrete Applied Mathematics 302 (2021), 34-41.

23. Non-1-planarity of lexicographic products of graphs, N. Matsumoto and Y. Suzuki, Discussiones Mathematicae Graph Theory 41 (2021), 1103-1114.

24. Game edge-connectivity of graphs, N. Matsumoto and T. Nakamigawa, Discrete Applied Mathematics 298 (2021), 155-164.

25. Quadrangulations of a polygon with spirality, F. Hidaka, N. Matsumoto and A. Nakamoto, Graphs and Combinatorics 37 (2021), 1905-1912.

26. The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices, N. Matsumoto and M. Tanaka, Aequationes Mathematicae 95 (2021), 319-328.

27. A necessary and sufficient condition for partial monotonicity of noncooperative games, N. Matsumoto, International Game Theory Review 22 (2020), #2050006.

28. Game connectivity of graphs, N. Matsumoto and T. Nakamigawa, Discrete Mathematics 343 (2020), #112104.

29. Diagonal flips in plane graphs with triangular and quadrangular faces, N. Matsumoto, A. Nakamoto and S. Negami, Discrete Applied Mathematics 283 (2020), 292-305.

30. Sufficient conditions for the existence of stable sets of cooperative games, N. Matsumoto and M. Minegishi, Economics Bulletin 40 (2020), 1958-1962.

31. Domatically perfect graphs, N. Matsumoto, AKCE International Journal of Graphs and Combinatorics 17 (2020), 242-251.

32. Facial achromatic number of triangulations on the sphere, N. Matsumoto and Y. Ohno, Discrete Mathematics 343 (2020), #111651.

33. N-flips in triangulations with two odd degree vertices, Y. Asayama, R. Matsukawa, N. Matsumoto and A. Nakamoto, Graphs and Combinatorics 36 (2020), 469-490.

34. Convex grabbing game of the point set on the plane, N. Matsumoto, T. Nakamigawa and T. Sakuma, Graphs and Combinatorics 36 (2020), 51-62.

35. The difference between game chromatic number and chromatic number of graphs, N. Matsumoto, Information Processing Letters 151 (2019), #105835.

36. Triangles in uniquely 3-colorable graphs on surfaces, N. Matsumoto, Australasian Journal of Combinatorics 75 (2019), 17-31.

37. On uniquely 3-colorable plane graphs without adjacent faces of prescribed degrees, Z. Li, N. Matsumoto, E. Zhu, J. Xu and T. Jensen, Mathematics, 7 (2019), #793.

38. Upper bounds on the locating chromatic number of trees, M. Furuya and N. Matsumoto, Discrete Applied Mathematics 257 (2019), 338-341.

39. A note on domination 3-edge-critical planar graphs, M. Furuya and N. Matsumoto, Information Processing Letters 142 (2019), 64-67.

40. Forbidden subgraphs for k vertex-disjoint stars, M. Furuya and N. Matsumoto, Journal of Combinatorics 9 (2018), 721-738.

41. Generating even triangulations on the Klein bottle, Y. Asayama, N. Matsumoto, A. Nakamoto and S. Ogano, Graphs and Combinatorics 34 (2018), 727-757.

42. Generating even triangulations on the torus, N. Matsumoto, A. Nakamoto and T. Yamaguchi, Discrete Mathematics 341 (2018), 2035-2048.

43. The graph grabbing game on K_{m,n}-trees, Y. Egawa, H. Enomoto and N. Matsumoto, Discrete Mathematics 341 (2018), 1555-1560.

44. Grünbaum colorings of even triangulations on surfaces, M. Kotrbčík, N. Matsumoto, B. Mohar, A. Nakamoto, K. Noguchi, K. Ozeki and A. Vodopivec, Journal of Graph Theory 87 (2018), 475–491.

45. On uniquely k-list colorable planar graphs, graphs on surfaces, and regular graphs, M. Abdolmaleki, J.P. Hutchinson, S.Gh. Ilchi, E.S. Mahmoodian, N. Matsumoto and M.A. Shabani, Graphs and Combinatorics 34 (2018), 383-394.

46. Quadrangulations on the projective plane with a K_{3,4}-minor, N. Matsumoto, A. Nakamoto and S. Yonekura, Yokohama Mathematical Journal 63 (2017), 117-129.

47. Vertex-addition strategy for domination-like invariants, M. Furuya and N. Matsumoto, Electronic Journal of Combinatorics 24 (2017), P3-45.

48. Conjectures on uniquely 3-edge colorable graphs, N. Matsumoto, Contributions to Discrete Mathematics 12 (2017), 123-132.

49. Proper orientations of planar bipartite graphs, F. Knox, S. González Hermosillo de la Maza, N. Matsumoto, B. Mohar and C. Linhares Sales, Graphs and Combinatorics 33 (2017), 1189–1194.

50. Note on 6-regular graphs on the Klein bottle, M. Kasai, N. Matsumoto, A. Nakamoto, T. Nozawa, H. Seno and Y. Takiguchi, Theory and Applications of Graphs 4 (2017), Article #5.

51. Diagonal transformations in pentangulations on the sphere, J. Kanno, N. Matsumoto, J. Su, and K. Yamamoto, Ars Combinatoria 135 (2017), 299-310.

52. Edge rotations in graphs on the sphere, N. Matsumoto, Congressus numerantium 227 (2016), 257-267.

53. Grünbaum colorings of triangulations on the projective plane, M. Kasai, N. Matsumoto and A. Nakamoto, Discrete Applied Mathematics 215 (2016), 155-163.

54. Minor relation for quadrangulations on the projective plane, N. Matsumoto, A. Nakamoto and S. Yonekura, Discrete Applied Mathematics 209 (2016), 296-302.

55. N-flips in 4-connected even triangulations on the sphere, Y. Kawasaki, N. Matsumoto and A. Nakamoto, Graphs and Combinatorics 31 (2015), 1889-1904.

56. Minor relations for quadrangulations on the sphere, S. Bau, N. Matsumoto, A. Nakamoto and L. Zheng, Graphs and Combinatorics 31 (2015), 2029-2036.

57. A note on the domination number of triangulations, M. Furuya and N. Matsumoto, Journal of Graph Theory 79 (2015), 83-85.

58. Transitions of hexangulations on the sphere, N. Matsumoto, Graphs and Combinatorics 31 (2015), 201-219.

59. Generating 4-connected even triangulations on the sphere, N. Matsumoto and A. Nakamoto, Discrete Mathematics 338 (2015), 64-70.

60. Uniquely colorable graphs on surfaces, N. Matsumoto and K. Noguchi, Ars Combinatoria 114 (2014), 177-183.

61. The size of edge-critical uniquely 3-colorable planar graphs, N. Matsumoto, Electronic Journal of Combinatorics 20 (2013), P49.

62. The number of diagonal transformations in quadrangulations on the sphere, N. Matsumoto and A. Nakamoto, Lecture Notes in Computer Science 8296 (2013), 110-119.

63. Diagonal transformations in hexangulations on the sphere, N. Matsumoto, Yokohama Mathematical Journal 57 (2011), 89-101.

Refereed International Conference Proceedings

1. Minimum Steiner Tree Approximation for Extracting Unknown Information via Avoiding High-Centrality Nodes, R. Nishiyama, A. Shin, N. Matsumoto and K. Kaneko,  2024 International Conference on Information Networking (ICOIN), (2024), 584--589.

2. Node-centric random walk for fast index-free personalized PageRank, K. Tsuchida, N. Matsumoto and K. Kaneko, 2023 International Conference on Information Networking (ICOIN), (2023), 194-199.

3. Geometric quadrangulations of a polygon, A. Nakamoto, G. Kawatani, N. Matsumoto and J. Urrutia, Electronic Notes in Discrete Mathematics 68 (2018), 59-64.

4. Transformations in hexangulations on the sphere, N. Matsumoto and A. Nakamoto, Electronic Notes in Discrete Mathematics 37 (2011), 621-626.

Submitted Papers

1. αFlexWalk: Index-based random walk path generation for arbitrary termination probabilities, T. Yamashita, N. Matsumoto, K. Kaneko.

2. General position number of hierarchical scale-free graphs

3. Playing Rubik's Cage, N. Matsumoto, H. Narisawa, S. Sakamoto, Y. Takai and T. Yashima.

4. Weighted APPR with Restart for Community Extraction from Multi-Layer Networks, S. Nakano, T. Yamashita, A. Shin, N. Matsumoto and K. Kaneko.

5. Kempe equivalence of 4-colorings of graphs on non-orientable surfaces

6. Re-Indexing Free Top-k Personalized PageRank Computations on Dynamic Graphs, T. Yamashita, N. Matsumoto, K. Kaneko.

7. Linear number of diagonal flips in 4-connected triangulations on the sphere, Y. Kawasaki, N. Matsumoto and A. Nakamoto. 

8. On infinite sequences of minimal graphs containing monochromatic triangles for any edge 2-coloring, N. Matsumoto and M. Yamamoto. 

9. Cover time of graphs with bounded genus, N. Matsumoto and Y. Takai.

10. Local community detection by random walk on hypergraphs, R. Oka, N. Matsumoto, Y. Takai, M. Ikeda and K. Kaneko.

Japanese Conference Proceedings (Non-refereed) 

1. グラフ更新時のインデックス再生成を排した Top-k Personalized PageRank 演算, 山下剛志, 松本直己, 金子晋丈, 信学技報, vol. 122, no. 407, IN2022-117, pp. 305-310, 2023年3月.

2. マルチレイヤネットワークのコミュニティ抽出におけるレイヤ反映度制御手法, 中野修平, 山下剛志, 松本直己, 金子晋丈, 信学技報, vol. 122, no. 342, IN2022-62, pp. 64-71, 2023年1月.

3. 近似最小シュタイナー木による指向性のある関心度推定, 小林 うらら, 松本 直己, 金子 晋丈, 信学技報, vol. 121, no. 42, IN2021-4, pp. 19-24, 2021年5月.

4. ランダムウォークを用いたハイパーグラフにおけるローカルコミュニティと弱い紐帯の抽出, 岡 亮, 高井 勇輝, 松本 直己, 池田 正弘, 金子 晋丈, 信学技報, vol. 120, no. 311, IN2020-41, pp. 1-6, 2021年1月.