Abstract
AbstractLet be the minimum cardinality of a set of vertices that intersects every longest cycle of a 2‐connected graph . We show that if is a partial ‐tree and that if is chordal, where is the cardinality of a maximum clique in . Those results imply that all longest cycles intersect in 2‐connected series‐parallel graphs and in 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.
