4 papers
Forbidden subgraphs generating a finite set of graphs with minimum degree three and large girth
Yoshimi Egawa, Michitaka Furuya
For a family of graphs, a graph is said to be {\it -free} if contains no member of as an induced subgraph. We let $\tilde{\mathcal{…
New Invariants for Partitioning a Graph into 2-connected Subgraphs
Michitaka Furuya, Masaki Kashima, Katsuhiro Ota
A vertex partition in which every part induces a 2-connected subgraph is called a 2-proper partition. This concept was introduced by Ferrara et al. in 2013, and Borozan et al. gave…
A necessary and sufficient condition for the existence of a properly coloured -factor in an edge-coloured graph
Roman Čada, Michitaka Furuya, Kenji Kimura +3
The main result of this paper is an edge-coloured version of Tutte's -factor theorem. We give a necessary and sufficient condition for an edge-coloured graph to have a pro…
A characterization of domination weak bicritical graphs with large diameter
Michitaka Furuya
The domination number of a graph , denoted by , is the minimum cardinality of a dominating set of . A vertex of a graph is called critical if its deletion decreases the…