1 citations · 1 across the 16 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024
On the complexity of finding a spanning even tree in a graph
Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita +4
A tree is said to be even if for every pair of distinct leaves, the length of the unique path between them is even. In this paper we discuss the problem of determining whether an i…
math.CO2024
An improved spectral lower bound of treewidth
Tatsuya Gima, Tesshu Hanaka, Kohei Noro +2
We show that for every -vertex graph with at least one edge, its treewidth is greater than or equal to , where and are the maximum degree a…