Výsledky vyhledávání - "Yashima Takamasa"

Akademický článek

Degree Sum Condition for the Existence of Spanning k-Trees in Star-Free Graphs

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

Zobrazit plný text záznamu

Akademický článek

A Degree Condition Implying Ore-Type Condition for Even [2, b]-Factors in Graphs

Autor: Tsuchiya Shoichi, Yashima Takamasa

Publikováno v: Discussiones Mathematicae Graph Theory, Vol 37, Iss 3, Pp 797-809 (2017)

For a graph G and even integers b ⩾ a ⩾ 2, a spanning subgraph F of G such that a ⩽ degF (x) ⩽ b and degF (x) is even for all x ∈ V (F) is called an even [a, b]-factor of G. In this paper, we show that a 2-edge-connected graph G of order n

Externí odkaz: https://doaj.org/article/d5c2cc00c7f045718a83ec2965773f61

Zobrazit plný text záznamu

Report

A necessary and sufficient condition for the existence of a properly coloured $f$-factor in an edge-coloured graph

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