Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
From MaRDI portal
Publication:1297424
DOI10.1016/S0012-365X(98)00334-3zbMATH Open0927.05053WikidataQ127532707 ScholiaQ127532707MaRDI QIDQ1297424FDOQ1297424
Authors: Jan Brousek, Zdeněk Ryjáček, Odile Favaron 
Publication date: 29 September 1999
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Graph theory
- Claw-free graphs---a survey
- On a closure concept in claw-free graphs
- Hamiltonicity in claw-free graphs
- Characterizing forbidden pairs for hamiltonian properties
- Forbidden subgraphs and Hamiltonian properties and graphs
- Minimal \(2\)-connected non-Hamiltonian claw-free graphs
- Title not available (Why is that?)
- The edge Hamiltonian path problem is NP-complete
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sufficient conditions for a graph to be Hamiltonian
- Title not available (Why is that?)
Cited In (42)
- Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs
- Heavy subgraphs, stability and Hamiltonicity
- Closure and forbidden pairs for 2-factors
- The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs
- The local structure of claw-free graphs without induced generalized bulls
- Forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs
- Characterizing forbidden clawless triples implying Hamiltonian graphs
- Forbidden pairs and the existence of a dominating cycle
- Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
- Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
- Forbidden pairs of disconnected graphs implying Hamiltonicity
- On \(s\)-Hamiltonicity of net-free line graphs
- Pairs of forbidden subgraphs and 2-connected supereulerian graphs
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected
- Characterizing forbidden pairs for relative length of longest paths and cycles
- On Hamiltonicity of 2-connected claw-free graphs
- Hamilton‐connected {claw, net}‐free graphs, I
- On Hamiltonicity of 3-connected claw-free graphs
- Hamiltonicities of double domination critical and stable claw-free graphs
- Claw-free 3-connectedP11-free graphs are hamiltonian
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
- The Ryjáček closure and a forbidden subgraph
- Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs
- Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs
- Stability of hereditary graph classes under closure operations
- Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs
- Forbidden pairs of disconnected graphs for 2‐factor of connected graphs
- Forbidden pairs of disconnected graphs for supereulerianity of connected graphs
- Forbidden subgraphs, stability and hamiltonicity
- Closure and forbidden pairs for Hamiltonicity
- On forbidden pairs implying Hamilton-connectedness
- Forbidden subgraphs for collapsible graphs and supereulerian graphs
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Forbidden subgraphs that imply 2-factors
- Hamilton‐connected {claw,net}‐free graphs, II
- A note on 3-connected hourglass-free claw-free Hamilton-connected graphs
- Forbidden pairs of disconnected graphs for traceability in connected graphs
- Forbidden pairs for spanning (closed) trails
- Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II
- A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs
- 2-Trees: Structural insights and the study of Hamiltonian paths
This page was built for publication: Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297424)
