Zobrazeno 1 - 10
of 82
pro vyhledávání: '"Tsuchiya, Shoichi"'
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
Publikováno v:
In Discrete Mathematics February 2025 348(2)
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Shan, Songling1 (AUTHOR), Tsuchiya, Shoichi2 (AUTHOR) s.tsuchiya@isc.senshu-u.ac.jp
Publikováno v:
Journal of Graph Theory. Dec2023, Vol. 104 Issue 4, p886-903. 18p.
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
Tutte showed that $4$-connected planar graphs are Hamiltonian, but it is well known that $3$-connected planar graphs need not be Hamiltonian. We show that $K_{2,5}$-minor-free $3$-connected planar graphs are Hamiltonian. This does not extend to $K_{2
Externí odkaz:
http://arxiv.org/abs/1610.06558
When we study forbidden subgraph conditions guaranteeing graphs to have some properties, a claw (or $K_{1,3}$) frequently appears as one of forbidden subgraphs. Recently, Furuya and Tsuchiya compared two classes generated by different forbidden pairs
Externí odkaz:
http://arxiv.org/abs/1505.00386
A cycle is a graph is dominating if every edge of the graph is incident with a vertex of the cycle. In this paper, we investigate the characterization of the class of the forbidden pairs guaranteeing the existence of a dominating cycle and show the f
Externí odkaz:
http://arxiv.org/abs/1502.02933
A cycle in a graph is called dominating if every edge of the graph is incident with a vertex of the cycle. In this paper, we investigate forbidden pairs guaranteeing the existence of a dominating cycle in 2-connected graphs.
Comment: 19 pages, 1
Comment: 19 pages, 1
Externí odkaz:
http://arxiv.org/abs/1502.02159