Abstract
Two graphs G and H with the same vertex set V are P 4- 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 P 4) in G if and only if π( S) induces a P 4 in H. This paper gives a characterization of all graphs P 4-isomorphic to a bipartite graph, which we call bipartite-perfect graphs. The characterization is based on graphs P 4-isomorphic to a tree previously described by A. Brandstädt and the author, and implies a linear time recognition algorithm for bipartite-perfect graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
