授業で集めたデータを元にした推定，検定に関する授業の実践事例
松村初, Lead
茨城大学教育学部紀要（教育科学）, 31 Jan. 2024
Spanning trees with small diameters
Mikio Kano; Hajime Matsumura
AKCE International Journal of Graphs and Combinatorics, 04 Jun. 2020, [Reviewed]
エビデンスに基づく校内研修
大西有; 松村初
茨城大学全学教職センター研究報告（2019）, 26 Feb. 2020
面積１の正方形を用いた条件付き確率の解法
松村初
茨城大学教育学部紀要（教育科学）, Jan. 2020
5枚のカードを用いたコピープロトコルの改良
中川祐弥; 松村初
茨城大学教育学部紀要（自然科学）, Jan. 2020
教員養成課程における算数に対する大学生の信念
野村幸代; 松村初; 小口祐一
高知大学学校教育研究, Mar. 2019
エクセルを用いたプログラミングの授業
松村初
茨城大学教育学部紀要（教育科学）, 31 Jan. 2019
小学校算数科における学習内容の統合的・発展的な扱い
小口祐一; 梅津健一郎; 栗原博之; 松村初; 吉井豊
茨城大学教育学部紀要（教育科学）, 30 Jan. 2018
A spanning k-spider in a graphRyota Matsubara; Haruhide Matsuda and Hajime Matsumura, A spider is a rooted tree in which each vertex has degree one or two, except for the root. Moreover, for an integer k >= 2, a k-spider is a spider where the root has degree at most k. This paper gives degree conditions for a graph to have a spanning k-spider., CHARLES BABBAGE RES CTR
Ars Combinatoria, Jan. 2018,
[Reviewed] Degree sum conditions for path-factors with specified end vertices in bipartite graphsRyota Matsubara; Hajime Matsumura; Masao Tsugaki; Tomoki Yamashita, Let G be a graph, and let S be a subset of the vertex set of G. We denote the set of the end vertices of a path P by end(P). A path P is an S-path if vertical bar V(P)vertical bar >= 2 and V(P) boolean AND S = end(P). An S-path-system is a graph H such that H contains all vertices of S and every component of H is an S-path. In this paper, we give a sharp degree sum condition for a bipartite graph to have a spanning S-path-system. (C) 2016 Elsevier B.V. All rights reserved., ELSEVIER SCIENCE BV
DISCRETE MATHEMATICS, Feb. 2017,
[Reviewed] On a spanning k-tree in which specified vertices have degree less than kHajime Matsumura, A k-tree is a tree with maximum degree at most k. In this paper, we give a degree sum condition for a graph to have a spanning k-tree in which specified vertices have degree less than k. We denote by sigma(k)(G) the minimum value of the degree sum of k independent vertices in a graph G. Let k >= 3 and s >= 0 be integers, and suppose G is a connected graph and sigma(k) (G) >= vertical bar V(G)vertical bar + s - 1. Then for any s specified vertices, G contains a spanning k-tree in which every specified vertex has degree less than k. The degree condition is sharp., UNIV ZIELONA GORA
Discussiones Mathematicae Graph Theory, Jan. 2015,
[Reviewed] Degree bounded spanning treesJun Fujisawa; Hajime Matsumura; Tomoki Yamashita, In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n >= 1, k >= 3, c >= 0 and G be an n-connected graph. Suppose that for every independent set S. V( G) of cardinality n( k - 1) + c + 2, there exists a vertex set X. S of cardinality k such that the degree sum of vertices in X is at least |V(G)| - c - 1. Then G has a spanning tree T with maximum degree at most k + [c/n] and Sigma(v is an element of V(T)) max{d(T) (v) - k, 0} <= c., SPRINGER TOKYO
Graphs and Combinatorics, Sep. 2010,
[Reviewed] Degree conditions and degree bounded trees
Haruhide Matsuda; Hajime Matsumura
Discrete Mathematics, Jun. 2009, [Reviewed]
Cycle-partitions with specified vertices and edgesHikoe Enomoto; Hajime Matsumura, In this paper, we consider cycle-partition problems which deal with the case when both vertices and edges are specified and we require that they should belong to different cycles. Minimum degree and degree sum conditions are given, which are best possible., CHARLES BABBAGE RES CTR
Ars Combinatoria, Apr. 2009,
[Reviewed] Partitions of a graph into cycles containing a specified linear forest
Ryota Matsubara; Hajime Matsumura
Discussiones Mathematicae. Graph Theory, Jan. 2008, [Reviewed]
A note on a longest cycle which is vertex dominating
Hajime Matsumura; Kenta Ozeki; Takeshi Sugiyama
AKCE International Journal of Graphs and Combinatorics, Dec. 2007
Vertex-disjoint short cycles containing specified edges in a graphHajime Matsumura, We call a cycle whose length is at most 5 a short cycle. In this paper, we consider the packing of short cycles in a graph with specified edges. A minimum degree condition is obtained, which is slightly weaker than that of the result in [1]., CHARLES BABBAGE RES CTR
Ars Combinatoria, Jul. 2006,
[Reviewed] On a k-tree containing specified leaves in a graph
Haruhide Matsuda; Hajime Matsumura
Graphs and Combinatorics, Jun. 2006, [Reviewed]
Degree sum conditions and vertex-disjoint cycles in a graph
Shinya Fujita; Hajime Matsumura; Masao Tsugaki; Tomoki Yamashita
The Australasian Journal of Combinatorics, Jun. 2006, [Reviewed]
Vertex disjoint cycles containing specified paths of order 3 in a bipartite graph
Ryota Matsubara; Hajime Matsumura
SUT Journal of Mathematics, Dec. 2005, [Reviewed]
