Abstract
A characterization of partial 3-trees is given based on the elimination sequence of vertices. It is proved that a partial 3-tree contains a vertex set satisfying either of certain three kinds of neighborhood relations on vertices and that a graph is a partial 3-tree if and only if eliminating such a vertex set results in a partial 3-tree. These results yield anO(n 2) time algorithm to recognize 3-trees.
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.
