On the complexity of finding a spanning even tree in a graph
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913623068114944 |
|---|---|
| author | Hanaka, Tesshu Kobayashi, Yasuaki Kurita, Kazuhiro Matsui, Yasuko Nagao, Atsuki Ono, Hirotaka Seto, Kazuhisa |
| author_facet | Hanaka, Tesshu Kobayashi, Yasuaki Kurita, Kazuhiro Matsui, Yasuko Nagao, Atsuki Ono, Hirotaka Seto, Kazuhisa |
| contents | 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 input graph has a spanning even tree. Hofmann and Walsh [Australas. J Comb. 35, 2006] proved that this problem can be solved in polynomial time on bipartite graphs. In contrast to this, we show that this problem is NP-complete even on planar graphs. We also give polynomial-time algorithms for several restricted classes of graphs, such as split graphs, cographs, cobipartite graphs, unit interval graphs, and block graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_17307 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the complexity of finding a spanning even tree in a graph Hanaka, Tesshu Kobayashi, Yasuaki Kurita, Kazuhiro Matsui, Yasuko Nagao, Atsuki Ono, Hirotaka Seto, Kazuhisa Data Structures and Algorithms Discrete Mathematics Combinatorics 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 input graph has a spanning even tree. Hofmann and Walsh [Australas. J Comb. 35, 2006] proved that this problem can be solved in polynomial time on bipartite graphs. In contrast to this, we show that this problem is NP-complete even on planar graphs. We also give polynomial-time algorithms for several restricted classes of graphs, such as split graphs, cographs, cobipartite graphs, unit interval graphs, and block graphs. |
| title | On the complexity of finding a spanning even tree in a graph |
| topic | Data Structures and Algorithms Discrete Mathematics Combinatorics |
| url | https://arxiv.org/abs/2412.17307 |