Coloring planar perfect graphs by decomposition
Combinatorica
Decomposition of perfect graphs
Journal of Combinatorial Theory Series B
Graphs and Hypergraphs
The coloring and maximum independent set problems on planar perfect graphs
Journal of the ACM (JACM)
ACM Transactions on Algorithms (TALG)
Finding an induced path of given parity in planar graphs in polynomial time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A faster algorithm to recognize even-hole-free graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Recognizing max-flow min-cut path matrices
Operations Research Letters
| Hi-index | 0.00 |
An O(n3) algorithm for recognizing planar graphs that do not contain induced odd cycles of length greater than 3 (odd holes) is presented. A planar graph with this property satisfies the requirement that its maximum clique size equal the minimum number of colors required for the graph (graphs all of whose induced subgraphs satisfy the latter property are perfect as defined by Berge). The algorithm presented is based on decomposing these graphs into essentially two special classes of inseparable component graphs that are easy to recognize. They are (i) planar comparability graphs and (ii) planar line graphs of those planar bipartite graphs whose maximum degrees are no greater than 3. Composition schemes for generating planar perfect graphs from those basic components are also provided. This decomposition algorithm can also be adapted to solve the corresponding maximum independent set and minimum coloring problems. Finally, the path-parity problem on planar perfect graphs is considered.