Abstract
A simple graph is P 4 -indifferent if it admits a total order < on its nodes such that every chordless path with nodes a, b, c, d and edges ab, bc, cd has a< b< c< d or a> b> c> d. P 4-indifferent graphs generalize indifferent graphs and are perfectly orderable. Recently, Hoàng; Maffray and Noy gave a characterization of P 4-indifferent graphs in terms of forbidden induced subgraphs. We clarify their proof and describe a linear time algorithm to recognize P 4-indifferent graphs. When the input is a P 4-indifferent graph, then the algorithm computes an order < as above.
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.
