Spanning Weakly Even Trees of Graphs
Journal of Graph Theory · 2026-08 · 112 (4) · 484-490
DOI: 10.1002/jgt.70041 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 16.04.2026. Verfasst von Jiangdong Ai und 7 weiteren Autor:innen. Die Arbeit nennt 6 Literaturangaben. Gefördert von: National Science Foundation.
Abstract (Originalsprache)
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.
Förderung
- National Science Foundation
Zitieren
APA
Ai, J., Ellingham, M. N., Gao, Z., Huang, Y., Liu, X., Shan, S., Špacapan, S., & Yue, J. (2026). Spanning Weakly Even Trees of Graphs. Journal of Graph Theory, 112(4), 484-490. https://doi.org/10.1002/jgt.70041
Vancouver
Ai J, Ellingham MN, Gao Z, Huang Y, Liu X, Shan S, et al. Spanning Weakly Even Trees of Graphs. Journal of Graph Theory. 2026;112(4):484-490. doi:10.1002/jgt.70041
BibTeX
@article{Ai2026,
author = {Ai, Jiangdong and Ellingham, M. N. and Gao, Zhipeng and Huang, Yixuan and Liu, Xiangzhou and Shan, Songling and Špacapan, Simon and Yue, Jun},
title = {Spanning Weakly Even Trees of Graphs},
journal = {Journal of Graph Theory},
year = {2026},
volume = {112},
number = {4},
pages = {484--490},
doi = {10.1002/jgt.70041}
}
EUVIMED