Polynomial time recognition of P4-structure

Authors:
R. B. Hayward;S. Hougardy;B. A. Reed
Affiliations:
University of Alberta, Edmonton, Alberta, Canada;Humboldt-Universität zu Berlin, 10099 Berlin Germany;McGill University, Montreal, Quebec, Canada
Venue:
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2002

Citing 10
Cited 1

A semi-strong perfect graph theorem

Journal of Combinatorial Theory Series B
On the P4-structure of perfect graphs. III. partner decompositions

Journal of Combinatorial Theory Series A
On the P4 structure of perfect graphs

Journal of Combinatorial Theory Series B
On the sibling-structure of perfect graphs

Journal of Combinatorial Theory Series B
P4-trees and substitution decomposition

Discrete Applied Mathematics
Recognizing P3-structure: a switching approach

Journal of Combinatorial Theory Series B
On the P4-structure of perfect graphs: V. Overlap graphs

Journal of Combinatorial Theory Series B
Linear-time modular decomposition and efficient transitive orientation of comparability graphs

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A New Linear Algorithm for Modular Decomposition

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

On the complexity of the G-reconstruction problem

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A P4 is a set of four vertices of a graph that induces a chordless path; the P4-structure of a graph is the set of all P4's. Vašek Chvátal asked if there is a polynomial time algorithm to determine whether an arbitrary four-uniform hypergraph is the P4-structure of some graph. The answer is yes; we present such an algorithm.