Xuong tree
Summary
In graph theory, a Xuong tree is a spanning tree of a given graph with the property that, in the remaining graph , the number of connected components with an odd number of edges is as small as possible. They are named after Nguyen Huy Xuong, who used them to characterize the cellular embeddings of a given graph having the largest possible genus.
Further reading
- Wikipedia, page 56061994, revision 1329719589, Xuong tree. adopted
About this page
| Tag | KR62B531VT |
|---|---|
| URI | m2://KR62B531VT |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.