On the Extension of Bipartite to Parity Graphs

Parity graphs form a superclass of bipartite and distance-hereditary graphs. Since their introduction, all the algorithms proposed as solutions to the recognition problem and other combinatorial problems exploit the structural property of these graphs described by Burlet and Uhry (Berge and Chv

• Type: Journal
• Year: 1999
• Where: DAM
• Authors: Serafino Cicerone, Gabriele Di Stefano
• Keywords: DAM 1999, Parity Graph, Recognition Problem, Structural Property