Abstract

In Faudree and Gould (1997), the authors determined all pairs of connected graphs {H1,H2} such that any connected {H1,H2}-free graph has a spanning path (cycle), i.e., hamiltonian path (cycle). In this paper, we consider a similar problem and determine all pairs of forbidden subgraphs guaranteeing the existence of spanning (closed) trails of connected graphs. Our results show that although the forbidden pairs for the existence of spanning trails are the same as the existence of spanning paths, the forbidden pairs for the existence of spanning closed trails (supereulerian) are much different from those for the existence of spanning cycles (hamiltonian).

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 call

Disclaimer: 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.