Characterizing forbidden pairs for hamiltonian properties

@article{Faudree1997CharacterizingFP,
  title={Characterizing forbidden pairs for hamiltonian properties},
  author={R. Faudree and R. Gould},
  journal={Discret. Math.},
  year={1997},
  volume={173},
  pages={45-60}
}
Abstract In this paper we characterize those pairs of forbidden subgraphs sufficient to imply various hamiltonian type properties in graphs. In particular, we find all forbidden pairs sufficient, along with a minor connectivity condition, to imply a graph is traceable, hamiltonian, pancyclic, panconnected or cycle extendable. We also consider the case of hamiltonian-connected graphs and present a result concerning the pairs for such graphs. 
114 Citations
Characterizing forbidden clawless triples implying hamiltonian graphs
  • 18
  • PDF
Hamiltonian Extendable Graphs
  • PDF
Hamiltonian Connected Graphs Involving Forbidden Subgraphs
  • 7
  • PDF
Traceability in graphs with forbidden triples of subgraphs
  • 11
  • PDF
Forbidden subgraphs and the existence of spanning k-trees
  • Highly Influenced
  • PDF
Forbidden triples and traceability: a characterization
  • 7
  • PDF
Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
  • 51
Forbidden Subgraphs for Hamiltonicity of 1-Tough Graphs
  • 4
  • PDF
Pairs of forbidden class of subgraphs concerning K1, 3 and P6 to have a cycle containing specified vertices
3-Connected {K1,3, P9}-Free Graphs are Hamiltonian-Connected
  • 4
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-8 OF 8 REFERENCES
Forbidden subgraphs and Hamiltonian properties of graphs
  • 55
  • PDF
Hamiltonicity in claw-free graphs
  • F. B. Shepherd
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 1991
  • 41
  • PDF
Extending cycles in graphs
  • G. Hendry
  • Computer Science, Mathematics
  • Discret. Math.
  • 1990
  • 75
  • PDF
Contemporary methods in graph theory
  • 69
Graph theory
  • 131