Abstract
Abstract Graphs without induced subgraphs of minimum degree at least 3 have been considered in matroid theory (see, e.g., Welsh 1976, ch. 14 or Aigner 1979, ch. 7) and in some domains of applications (Todd 1989, Guenoche and Leclerc 1999). Maximal such graphs were characterized in Todd's paper. They are called here 2d-trees. A subclass of 2d-trees consists of the classical 2-trees (Pippert and Beineke 1969), whose interesting status among chordal, series parallel and 2-connected graphs has been extensively studied in the literature (Arnborg and proskurowski 1989, Borie, Parker and Tovey 1991, Rose 1974, and others). We consider here valued 2d-trees and 2-trees with a given finite vertex set X.
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.
