For a simple graph G, Wu and Wang (Graph Theory Notes of New York 39 (2000) 23-25) gave a necessary and sufficient condition for a jump graph J(G) to have a perfect matching.

• 对于一个简单图G，吴和王(Graph Theory Notes of New York 39(2000)23-25)给出了G的跳图有完美匹配的充分必要条件。