Abstract
AbstractThe famous Kőnig‐Egerváry theorem is equivalent to the statement that the matching number equals the vertex cover number for every induced subgraph of some graph if and only if that graph is bipartite. Inspired by this result, we consider the set of all graphs such that, for every induced subgraph, the maximum number of disjoint paths of order equals the minimum order of a set of vertices intersecting all paths of order . For , we give complete structural descriptions of the graphs in . Furthermore, for odd , we give a complete structural description of the graphs in that contain no cycle of order less than . For these graph classes, our results yield efficient recognition algorithms as well as efficient algorithms that determine maximum sets of disjoint paths of order and minimum sets of vertices intersecting all paths of order .
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.
