Abstract
A 4-uniform hypergraph represents the P 4-structure of a graph G, if its hyperedges are the vertex sets of the induced paths P 4 in G. We shall give in this paper a simple algorithm that recognizes the P 4-structure of a block graph in polynomial time. Here, block graphs are connected graphs in which all maximal 2-connected subgraphs are cliques. Our algorithm is based on a similar approach as that for trees by the authors and S. Olariu using weighted 2-section graphs of hypergraphs.
Sign-in/Register to access full text options 
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.
