Spanning Weakly Even Trees of Graphs

Journal of Graph Theory 2026 Open access

Read full text
Authors: Jiangdong Ai, Mark N. Ellingham, Zhipeng Gao, Yixuan Huang, Xiangzhou Liu, Songling Shan, Simon Špacapan, Jun Yue
DOI: 10.1002/jgt.70041
Cited by: 0

Abstract

ABSTRACT Let be a graph (with multiple edges allowed) and let be a tree in . We say that is even if every leaf of belongs to the same part of the bipartition of , and that is weakly even if every leaf of that has maximum degree in belongs to the same part of the bipartition of . We confirm two recent conjectures of Jackson and Yoshimoto by showing that every connected graph that is not a regular bipartite graph has a spanning weakly even tree.

Fields of Study & Subjects

Advanced Graph Theory Research Complexity and Algorithms in Graphs Graph Labeling and Dimension Problems

Publication details

Journal / source
Journal of Graph Theory
Volume
112
Issue
4
Pages
484–490
Publication date
16 April 2026
Language
EN