Characterizing forbidden pairs for hamiltonian properties
From MaRDI portal
Publication:1367026
DOI10.1016/S0012-365X(96)00147-1zbMath0879.05050WikidataQ105723847 ScholiaQ105723847MaRDI QIDQ1367026
Ralph J. Faudree, Ronald J. Gould
Publication date: 22 December 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Related Items (88)
Forbidden pairs of disconnected graphs for traceability in connected graphs ⋮ A Pair of Forbidden Subgraphs and 2-Factors ⋮ Forbidden pairs and \((k,m)\)-pancyclicity ⋮ Heavy subgraphs, stability and Hamiltonicity ⋮ Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected ⋮ Solution to a problem on Hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions ⋮ Nowhere-zero 3-flows and \(Z_3\)-connectivity of graphs without two forbidden subgraphs ⋮ Forbidden subgraphs that imply hamiltonian‐connectedness* ⋮ Characterizing forbidden pairs for relative length of longest paths and cycles ⋮ Clique-heavy subgraphs and pancyclicity of 2-connected graphs ⋮ Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs ⋮ Hamiltonian extendable graphs ⋮ Forbidden subgraphs for Hamiltonicity of 1-tough graphs ⋮ Dominating cycles and forbidden pairs containing \(P_5\) ⋮ Hamiltonian type properties in claw-free \(P_5\)-free graphs ⋮ Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs ⋮ 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 ⋮ Forbidden set of induced subgraphs for 2-connected supereulerian graphs ⋮ Forbidden subgraphs for chorded pancyclicity ⋮ Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian ⋮ Forbidden subgraphs on Hamiltonian index ⋮ Forbidden subgraphs and the existence of spanning \(k\)-trees ⋮ Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs ⋮ Forbidden subgraphs generating a finite set ⋮ Forbidden subgraphs and the existence of a spanning tree without small degree stems ⋮ Forbidden pairs and the existence of a spanning Halin subgraph ⋮ A forbidden pair for connected graphs to have spanning k‐trees ⋮ Forbidden pairs of disconnected graphs for supereulerianity of connected graphs ⋮ Forbidden pairs of disconnected graphs for 2‐factor of connected graphs ⋮ Hamilton‐connected {claw, bull}‐free graphs ⋮ Hamilton‐connected {claw, net}‐free graphs, I ⋮ Ramsey-type results for path covers and path partitions. II: Digraphs ⋮ Forbidden induced subgraphs for star-free graphs ⋮ Characterizing forbidden pairs for Hamiltonian squares ⋮ Claw-free and \(N(2,1,0)\)-free graphs are almost net-free ⋮ 2-Trees: Structural insights and the study of Hamiltonian paths ⋮ Closure and forbidden pairs for Hamiltonicity ⋮ Non-empty intersection of longest paths in \(H\)-free graphs ⋮ Disconnected forbidden subgraphs, toughness and Hamilton cycles ⋮ Forbidden subgraphs for supereulerian and Hamiltonian graphs ⋮ 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 ⋮ Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs ⋮ Heavy subgraph pairs for traceability of block-chains ⋮ Nonempty intersection of longest paths in graphs without forbidden pairs ⋮ Forbidden Subgraphs Generating Almost the Same Sets ⋮ Forbidden pairs for equality of connectivity and edge-connectivity of graphs ⋮ Pairs of forbidden subgraphs and 2-connected supereulerian graphs ⋮ Forbidden pairs for spanning (closed) trails ⋮ Forbidden triples for perfect matchings ⋮ Forbidden subgraphs for graphs with (near) perfect matching to be hamiltonian ⋮ Forbidden subgraphs that imply 2-factors ⋮ On Forbidden Pairs Implying Hamilton‐Connectedness ⋮ A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs ⋮ Forbidden subgraphs and weak locally connected graphs ⋮ Forbidden pairs with a common graph generating almost the same sets ⋮ Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs ⋮ Closure and forbidden pairs for 2-factors ⋮ A pair of forbidden subgraphs and perfect matchings. ⋮ Forbidden subgraphs and the existence of a 2-factor ⋮ Unnamed Item ⋮ Characterization of forbidden subgraphs for the existence of even factors in a graph ⋮ Fan's condition on induced subgraphs for circumference and pancyclicity ⋮ Hamilton circuits and essential girth of claw free graphs ⋮ Forbidden pairs and the existence of a dominating cycle ⋮ Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs ⋮ Toughness, forbidden subgraphs and pancyclicity ⋮ 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected ⋮ Implementation of RTO in a large hydrogen network considering uncertainty ⋮ Forbidden pairs for \(k\)-connected Hamiltonian graphs ⋮ On traceability of claw-\({o_{-1}}\)-heavy graphs ⋮ Critical graphs for subpancyclicity of 3-connected claw-free graphs ⋮ Unnamed Item ⋮ Forbidden subgraphs, hamiltonicity and closure in claw-free graphs ⋮ Traceability in graphs with forbidden triples of subgraphs ⋮ The local structure of claw-free graphs without induced generalized bulls ⋮ Stability of Hereditary Graph Classes Under Closure Operations ⋮ Forbidden triples and traceability: A characterization ⋮ Ramsey-type results for path covers and path partitions ⋮ Line graphs and forbidden induced subgraphs ⋮ Forbidden quadruplets generating a finite set of 2-connected graphs ⋮ Results and problems on chorded cycles: a survey ⋮ Forbidden subgraphs for longest cycles to contain vertices with large degrees ⋮ Forbidden subgraphs for existences of (connected) 2-factors of a graph
Cites Work
This page was built for publication: Characterizing forbidden pairs for hamiltonian properties
