scientific article
From MaRDI portal
zbMath0466.05049MaRDI QIDQ3918148
No author found.
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Heavy subgraphs, stability and Hamiltonicity, Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs, An improved degree based condition for Hamiltonian cycles, On independent vertex sets in subclasses of apple-free graphs, Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs, Claw-free graphs---a survey, Connectivity, traceability and Hamiltonicity, Dominating cycles and forbidden pairs containing \(P_5\), Characterizing forbidden pairs for hamiltonian properties, Extremal problems on the Hamiltonicity of claw-free graphs, Unit ball graphs on geodesic spaces, Cycles through all finite vertex sets in infinite graphs, A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs, Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian, Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs, Forbidden subgraphs and the existence of spanning \(k\)-trees, Forbidden subgraphs generating a finite set, A forbidden pair for connected graphs to have spanning k‐trees, Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls, Ramsey-type results for path covers and path partitions. II: Digraphs, Characterizing forbidden pairs for Hamiltonian squares, Claw-free and \(N(2,1,0)\)-free graphs are almost net-free, Forbidding and enforcing on graphs, Closure and forbidden pairs for Hamiltonicity, On linear and circular structure of (claw, net)-free graphs, On Hamiltonicity of \{claw, net\}-free graphs, Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path, Conditions for graphs to be path partition optimal, Pairs of forbidden induced subgraphs for homogeneously traceable graphs, Recent advances on the Hamiltonian problem: survey III, Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity, On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs, Forbidden subgraphs and Hamiltonian properties and graphs, Heavy subgraph pairs for traceability of block-chains, Existence of dominating cycles and paths, Hamiltonicity in claw-free graphs, Forbidden pairs for spanning (closed) trails, Forbidden pairs with a common graph generating almost the same sets, Closure and forbidden pairs for 2-factors, On distance-3 matchings and induced matchings, Fan's condition on induced subgraphs for circumference and pancyclicity, Forbidden subgraphs and the existence of paths and cycles passing through specified vertices, Characterizing the difference between graph classes defined by forbidden pairs including the claw, Hamilton circuits and essential girth of claw free graphs, Forbidden pairs and the existence of a dominating cycle, Induced nets and Hamiltonicity of claw-free graphs, On traceability of claw-\({o_{-1}}\)-heavy graphs, Unnamed Item, Forbidden subgraphs, stability and hamiltonicity, A look at cycles containing specified elements of a graph, A generalization of Fan's condition and forbidden subgraph conditions for hamiltonicity, Forbidden subgraphs, hamiltonicity and closure in claw-free graphs, Traceability in graphs with forbidden triples of subgraphs, Minimal \(2\)-connected non-Hamiltonian claw-free graphs, Forbidden triples and traceability: A characterization, Ramsey-type results for path covers and path partitions, Line graphs and forbidden induced subgraphs, Rainbow connection and forbidden subgraphs, Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs
