Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching

Abstract. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse graph which admits a perfect matching; in the case where the graph has a perfect matching, the solution to the problem is the entire graph. We establish a characterization of such subgraphs, and describe an algorithm for the problem which for a P4-sparse graph on n vertices and m edges, runs in O(n + m) time and space. The above results also hold for the class of complement reducible graphs or cographs, a well-known subclass of P4-sparse graphs.

• Type: Conference
• Year: 2005
• Where: PCI
• Authors: Stavros D. Nikolopoulos, Leonidas Palios
• Keywords: Informatics, Maximum-size Subgraph, P4-sparse Graphs, PCI 2005, Perfect Matching