Zobrazeno 1 - 10
of 198
pro vyhledávání: '"Furuya Michitaka"'
Autor:
Furuya Michitaka, Maezawa Shun-ichi, Matsubara Ryota, Matsuda Haruhide, Tsuchiya Shoichi, Yashima Takamasa
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 1, Pp 5-13 (2022)
For an integer k ≥ 2, a k-tree T is defined as a tree with maximum degree at most k. If a k-tree T spans a graph G, then T is called a spanning k-tree of G. Since a spanning 2-tree is a Hamiltonian path, a spanning k-tree is an extended concept of
Externí odkaz:
https://doaj.org/article/5cd98b7366c048698d83ce7b5e64ea4a
Autor:
Egawa, Yoshimi, Furuya, Michitaka
For a family $\mathcal{H}$ of graphs, a graph $G$ is said to be {\it $\mathcal{H}$-free} if $G$ contains no member of $\mathcal{H}$ as an induced subgraph. We let $\tilde{\mathcal{G}}_{3}(\mathcal{H})$ denote the family of connected $\mathcal{H}$-fre
Externí odkaz:
http://arxiv.org/abs/2404.10996
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 the best possible minimum degree condition for the existence of a 2-p
Externí odkaz:
http://arxiv.org/abs/2403.08465
Autor:
Čada, Roman, Furuya, Michitaka, Kimura, Kenji, Ozeki, Kenta, Purcell, Christopher, Yashima, Takamasa
The main result of this paper is an edge-coloured version of Tutte's $f$-factor theorem. We give a necessary and sufficient condition for an edge-coloured graph $G^c$ to have a properly coloured $f$-factor. We state and prove our result in terms of a
Externí odkaz:
http://arxiv.org/abs/2311.09042
Autor:
Furuya Michitaka
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 4, Pp 683-690 (2014)
An edge of a graph is called dot-critical if its contraction decreases the domination number. A graph is said to be dot-critical if all of its edges are dot-critical. A vertex of a graph is called critical if its deletion decreases the domination num
Externí odkaz:
https://doaj.org/article/7a6cc98ff12549f9af71bb65f4d60ae5
Autor:
Furuya, Michitaka, Tsuchiya, Shoichi
For an integer $k\geq 2$, a spanning tree of a graph without no vertices of degree from $2$ to $k$ is call a {\it $[2,k]$-ST} of the graph. The concept of $[2,k]$-STs is a natural extension of a homeomorphically irreducible spanning tree (or HIST), w
Externí odkaz:
http://arxiv.org/abs/2303.03762
A spanning tree of a graph without no vertices of degree $2$ is called a {\it homeomorphically irreducible spanning tree} (or a {\it HIST}) of the graph. Albertson, Berman, Hutchinson and Thomassen~[J. Graph Theory {\bf 14} (1990), 247--258] gave a m
Externí odkaz:
http://arxiv.org/abs/2303.02372
Autor:
Chiba, Shuya, Furuya, Michitaka
Gy\'{a}rf\'{a}s and Sumner independently conjectured that for every tree $T$, there exists a function $f_{T}:\mathbb{N}\rightarrow \mathbb{N}$ such that every $T$-free graph $G$ satisfies $\chi (G)\leq f_{T}(\omega (G))$, where $\chi (G)$ and $\omega
Externí odkaz:
http://arxiv.org/abs/2205.14466
Publikováno v:
In Discrete Mathematics February 2025 348(2)
Autor:
Chiba, Shuya, Furuya, Michitaka
Recently, the authors gave Ramsey-type results for the path cover/partition number of graphs. In this paper, we continue the research about them focusing on digraphs, and find a relationship between the path cover/partition number and forbidden struc
Externí odkaz:
http://arxiv.org/abs/2111.14284