A semi-strong perfect graph theorem
Journal of Combinatorial Theory Series B
P-Components and the Homogeneous Decomposition of Graphs
SIAM Journal on Discrete Mathematics
Graph classes: a survey
Modular decomposition and transitive orientation
Discrete Mathematics - Special issue on partial ordered sets
Recognizing the P4-structure of bipartite graphs
Discrete Applied Mathematics
Recognizing the P4-structure of block graphs
Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
A New Linear Algorithm for Modular Decomposition
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Split-Perfect Graphs: Characterizations and Algorithmic Use
SIAM Journal on Discrete Mathematics
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Split-Perfect Graphs: Characterizations and Algorithmic Use
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.04 |
Two graphs G and H with the same vertex set V are P4-isomorphic if there exists a permutation π on V such that, for all subsets S ⊆ V, S induces a chordless path on four vertices (denoted by P4) in G if and only if π(S) induces a P4 in H. This paper gives a characterization of all graphs P4-isomorphic to a bipartite graph, which we call bipartite-perfect graphs. The characterization is based on graphs P4-isomorphic to a tree previously described by A. Brandstädt and the author, and implies a linear time recognition algorithm for bipartite-perfect graphs.