scientific article
From MaRDI portal
Publication:3838206
zbMath0904.05055MaRDI QIDQ3838206
Ralph J. Faudree, Zdeněk Ryjáček, Ronald J. Gould, Ingo Schiermeyer
Publication date: 11 January 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)
Related Items (17)
Heavy subgraphs, stability and Hamiltonicity ⋮ Solution to a problem on Hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions ⋮ Characterizing forbidden pairs for hamiltonian properties ⋮ A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs ⋮ Forbidden subgraphs generating a finite set ⋮ Closure and forbidden pairs for Hamiltonicity ⋮ Compatible spanning circuits and forbidden induced subgraphs ⋮ Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs ⋮ Nonempty intersection of longest paths in graphs without forbidden pairs ⋮ Tree in forbidden triples generating a finite set of graphs with high connectivity ⋮ Forbidden pairs for spanning (closed) trails ⋮ Hamilton circuits and essential girth of claw free graphs ⋮ Forbidden pairs and the existence of a dominating cycle ⋮ FORBIDDEN TRIPLES GENERATING A FINITE SET OF GRAPHS WITH HIGH CONNECTIVITY ⋮ Forbidden triples containing a complete graph and a complete bipartite graph of small order ⋮ Forbidden subgraphs, hamiltonicity and closure in claw-free graphs ⋮ Forbidden quadruplets generating a finite set of 2-connected graphs
This page was built for publication:
