Spanning even trees of graphs
Journal of Graph Theory(2024)
摘要
AbstractA tree is said to be even if all pairs of vertices of degree one in are joined by a path of even length. We conjecture that every ‐regular nonbipartite connected graph has a spanning even tree and verify this conjecture when has a 2‐factor. Well‐known results of Petersen and Hanson et al. imply that the only remaining unsolved case is when is odd and has at least bridges. We investigate this case further and propose some related conjectures.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要