In graph theory, a Xuong tree is a spanning tree T {\displaystyle T} of a given graph G {\displaystyle G} with the property that, in the remaining graph G − T {\displaystyle G-T} , 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.

According to Xuong's results, if T {\displaystyle T} is a Xuong tree and the numbers of edges in the components of G − T {\displaystyle G-T} are m 1 , m 2 , … , m k {\displaystyle m_{1},m_{2},\dots ,m_{k}} , then the maximum genus of an embedding of G {\displaystyle G} is ∑ i = 1 k ⌊ m i / 2 ⌋ {\displaystyle \textstyle \sum _{i=1}^{k}\lfloor m_{i}/2\rfloor } . Any one of these components, having m i {\displaystyle m_{i}} edges, can be partitioned into ⌊ m i / 2 ⌋ {\displaystyle \lfloor m_{i}/2\rfloor } edge-disjoint two-edge paths, with possibly one additional left-over edge. An embedding of maximum genus may be obtained from a planar embedding of the Xuong tree by adding each two-edge path to the embedding in such a way that it increases the genus by one.

A Xuong tree, and a maximum-genus embedding derived from it, may be found in any graph in polynomial time, by a transformation to a more general computational problem on matroids, the matroid parity problem for linear matroids.