Výsledky vyhledávání - "Ota, Katsuhiro"

Report

Spanning plane subgraphs of $1$-plane graphs

Autor: Noguchi, Kenta, Ota, Katsuhiro, Suzuki, Yusuke

A graph drawn on the plane is called $1$-plane if each edge is crossed at most once by another edge. In this paper, we show that every $4$-connected $1$-plane graph has a connected spanning plane subgraph. We also show that there exist infinitely man

Externí odkaz: http://arxiv.org/abs/2404.05394

Zobrazit plný text záznamu

Report

New Invariants for Partitioning a Graph into 2-connected Subgraphs

Autor: Furuya, Michitaka, Kashima, Masaki, Ota, Katsuhiro

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

Zobrazit plný text záznamu

Report

Some conditions for hamiltonian cycles in 1-tough $(K_2 \cup kK_1)$-free graphs

Autor: Ota, Katsuhiro, Sanka, Masahiro

Let $k \geq 2$ be an integer. We say that a graph $G$ is $(K_2 \cup kK_1)$-free if it does not contain $K_2 \cup kK_1$ as an induced subgraph. Recently, Shi and Shan conjectured that every $1$-tough and $2k$-connected $(K_2 \cup kK_1)$-free graph is

Externí odkaz: http://arxiv.org/abs/2210.10408

Zobrazit plný text záznamu

Akademický článek

Some conditions for hamiltonian cycles in 1-tough (K2 ∪ kK1)-free graphs

Autor: Ota, Katsuhiro, Sanka, Masahiro

Publikováno v: In Discrete Mathematics March 2024 347(3)

Zobrazit plný text záznamu

Report

Hamiltonian cycles in 2-tough $2K_2$-free graphs

Autor: Ota, Katsuhiro, Sanka, Masahiro

A graph $G$ is called a $2K_2$-free graph if it does not contain $2K_2$ as an induced subgraph. In 2014, Broersma, Patel and Pyatkin showed that every 25-tough $2K_2$-free graph on at least three vertices is Hamiltonian. Recently, Shan improved this

Externí odkaz: http://arxiv.org/abs/2103.06760

Zobrazit plný text záznamu

Report

Minimum degree conditions for the existence of a sequence of cycles whose lengths differ by one or two

Autor: Chiba, Shuya, Ota, Katsuhiro, Yamashita, Tomoki

Gao, Huo, Liu and Ma (2019) proved a result on the existence of paths connecting specified two vertices whose lengths differ by one or two. By using this result, they settled two famous conjectures due to Thomassen (1983). In this paper, we improve t

Externí odkaz: http://arxiv.org/abs/2008.09783

Zobrazit plný text záznamu