Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
From MaRDI portal
Publication:1297424
DOI10.1016/S0012-365X(98)00334-3zbMath0927.05053WikidataQ127532707 ScholiaQ127532707MaRDI QIDQ1297424
Odile Favaron, Jan Brousek, Zdeněk Ryjáček
Publication date: 29 September 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (39)
Forbidden pairs of disconnected graphs for traceability in connected graphs ⋮ Claw-free 3-connectedP11-free graphs are hamiltonian ⋮ Heavy subgraphs, stability and Hamiltonicity ⋮ Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected ⋮ Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II ⋮ Characterizing forbidden pairs for relative length of longest paths and cycles ⋮ A note on 3-connected hourglass-free claw-free Hamilton-connected graphs ⋮ Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs ⋮ Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs ⋮ Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free 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 ⋮ On Hamiltonicity of 2-connected claw-free graphs ⋮ Hamiltonicities of double domination critical and stable claw-free graphs ⋮ Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs ⋮ Hamilton‐connected {claw,net}‐free graphs, II ⋮ Forbidden pairs of disconnected graphs for supereulerianity of connected graphs ⋮ Forbidden pairs of disconnected graphs for 2‐factor of connected graphs ⋮ Hamilton‐connected {claw, net}‐free graphs, I ⋮ 2-Trees: Structural insights and the study of Hamiltonian paths ⋮ Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity ⋮ Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs ⋮ On \(s\)-Hamiltonicity of net-free line graphs ⋮ Pairs of forbidden subgraphs and 2-connected supereulerian graphs ⋮ Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs ⋮ Forbidden pairs for spanning (closed) trails ⋮ Forbidden subgraphs that imply 2-factors ⋮ On Forbidden Pairs Implying Hamilton‐Connectedness ⋮ Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs ⋮ Closure and forbidden pairs for 2-factors ⋮ The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs ⋮ Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected ⋮ Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs ⋮ Forbidden pairs and the existence of a dominating cycle ⋮ On Hamiltonicity of 3-connected claw-free graphs ⋮ Forbidden subgraphs, stability and hamiltonicity ⋮ The local structure of claw-free graphs without induced generalized bulls ⋮ Stability of Hereditary Graph Classes Under Closure Operations ⋮ Forbidden subgraphs for collapsible graphs and supereulerian graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Forbidden subgraphs and Hamiltonian properties and graphs
- The edge Hamiltonian path problem is NP-complete
- Hamiltonicity in claw-free graphs
- Claw-free graphs---a survey
- On a closure concept in claw-free graphs
- Characterizing forbidden pairs for hamiltonian properties
- Minimal \(2\)-connected non-Hamiltonian claw-free graphs
- Sufficient conditions for a graph to be Hamiltonian
This page was built for publication: Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
