Xuong tree

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.

This keyword could refer to multiple things. Here are some suggestions: