Zobrazeno 1 - 10
of 66
pro vyhledávání: '"Michitaka Furuya"'
Autor:
Michitaka Furuya
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 20 no. 1, Iss Graph Theory (2018)
In this paper, we characterize the sets $\mathcal{H}$ of connected graphs such that there exists a constant $c=c(\mathcal{H})$ satisfying $\gamma (G)\leq c$ for every connected $\mathcal{H}$-free graph $G$, where $\gamma (G)$ is the domination number
Externí odkaz:
https://doaj.org/article/640c493806184d15863927ab423c79d6
Autor:
Yoshimi Egawa, Michitaka Furuya
Publikováno v:
Theory and Applications of Graphs, Vol 3, Iss 1 (2016)
In this paper, we show the following two theorems (here $c_{i}(G-X)$ is the number of components $C$ of $G-X$ with $|V(C)|=i$): (i)~If a graph $G$ satisfies $c_{1}(G-X)+\frac{1}{3}c_{3}(G-X)+\frac{1}{3}c_{5}(G-X)\leq \frac{2}{3}|X|$ for all $X\subset
Externí odkaz:
https://doaj.org/article/eac3fb86cbfd4e31a1951d7e9e8a6f22
Publikováno v:
Discrete Applied Mathematics. 333:132-135
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f093de55f20a71479b9d95b904b7a517
https://doi.org/10.1016/j.dam.2023.03.024
https://doi.org/10.1016/j.dam.2023.03.024
Publikováno v:
Discrete Applied Mathematics. 322:268-272
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::12859643e8d4f7f3624fdf086faa7aa8
https://doi.org/10.1016/j.dam.2022.08.016
https://doi.org/10.1016/j.dam.2022.08.016
Autor:
MICHITAKA FURUYA1 michitaka.furuya@gmail.com, SHUN-ICHI MAEZAWA2 maezawa-shunichi-bg@ynu.jp, RYOTA MATSUBARA3 ryota@sic.shibaura-it.ac.jp, HARUHIDE MATSUDA3 hmatsuda@sic.shibaura-it.ac.jp, SHOICHI TSUCHIYA4 s.tsuchiya@isc.senshu-u.ac.jp, TAKAMASA YASHIMA5 takamasa.yashima@gmail.com
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2022, Vol. 42 Issue 1, p5-13. 9p.
Autor:
Yoshimi Egawa, Michitaka Furuya
Publikováno v:
Discrete Applied Mathematics. 320:282-295
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0d8d51711c39cb038b6dfddbd2526803
https://doi.org/10.1016/j.dam.2022.05.001
https://doi.org/10.1016/j.dam.2022.05.001
Autor:
Shun ichi Maezawa, Ryota Matsubara, Takamasa Yashima, Shoichi Tsuchiya, Haruhide Matsuda, Michitaka Furuya
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://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae9b3f3915d365807184baf2934dd31b
https://doaj.org/article/5cd98b7366c048698d83ce7b5e64ea4a
https://doaj.org/article/5cd98b7366c048698d83ce7b5e64ea4a
Autor:
Michitaka Furuya
Publikováno v:
Discrete Applied Mathematics. 299:50-61
In this paper, we give a characterization or a property for trees T such that a component of T − e is a specific path for each edge e of T , and as corollaries of them, we obtain upper bounds on some domination-type invariants. We demonstrate how o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::736e610dbe8ebdff86f232c63bd10d5c
https://doi.org/10.1016/j.dam.2021.04.020
https://doi.org/10.1016/j.dam.2021.04.020
Publikováno v:
Graphs and Combinatorics. 36:167-176
In this paper, we focus on a so-called Fan-type condition assuring us the existence of long paths in bipartite graphs. As a consequence of our main result, we completely determine the bipartite Ramsey numbers $$b(P_{s},B_{t_{1},t_{2}})$$, where $$B_{
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a7ea9c468bf15a133576d774f49a3b1
https://doi.org/10.1007/s00373-019-02127-x
https://doi.org/10.1007/s00373-019-02127-x
Publikováno v:
Graphs and Combinatorics. 35:1459-1474
For two graphs A and B, a graph G is called $$\{A,B\}$$-free if G contains neither A nor B as an induced subgraph. Let $$P_{n}$$ denote the path of order n. For nonnegative integers k, $$\ell $$ and m, let $$N_{k,\ell ,m}$$ be the graph obtained from
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::381d587ccc016879e507eb6ca44fd396
https://doi.org/10.1007/s00373-019-02108-0
https://doi.org/10.1007/s00373-019-02108-0