Pages that link to "Item:Q1297424"
From MaRDI portal
The following pages link to Forbidden subgraphs, hamiltonicity and closure in claw-free graphs (Q1297424):
Displaying 39 items.
- Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected (Q292269) (← links)
- Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs (Q327292) (← links)
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian (Q370939) (← links)
- Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs (Q400354) (← links)
- Forbidden pairs for spanning (closed) trails (Q512584) (← links)
- On Hamiltonicity of 3-connected claw-free graphs (Q742642) (← links)
- Closure and forbidden pairs for 2-factors (Q968435) (← links)
- The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs (Q973108) (← links)
- Forbidden subgraphs, stability and hamiltonicity (Q1292819) (← links)
- Pairs of forbidden subgraphs and 2-connected supereulerian graphs (Q1744755) (← links)
- Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs (Q1744769) (← links)
- On Hamiltonicity of 2-connected claw-free graphs (Q1931154) (← links)
- Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected (Q2022131) (← links)
- Forbidden subgraphs for collapsible graphs and supereulerian graphs (Q2118236) (← links)
- Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II (Q2138949) (← links)
- Characterizing forbidden pairs for relative length of longest paths and cycles (Q2138962) (← links)
- A note on 3-connected hourglass-free claw-free Hamilton-connected graphs (Q2142648) (← links)
- Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs (Q2219958) (← links)
- On \(s\)-Hamiltonicity of net-free line graphs (Q2219965) (← links)
- The local structure of claw-free graphs without induced generalized bulls (Q2334073) (← links)
- Forbidden pairs of disconnected graphs for traceability in connected graphs (Q2359961) (← links)
- Heavy subgraphs, stability and Hamiltonicity (Q2364090) (← links)
- Hamiltonicities of double domination critical and stable claw-free graphs (Q2416952) (← links)
- Forbidden subgraphs that imply 2-factors (Q2477381) (← links)
- Forbidden pairs and the existence of a dominating cycle (Q2515588) (← links)
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs (Q2637726) (← links)
- Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs (Q2657065) (← links)
- A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs (Q2659232) (← links)
- Stability of Hereditary Graph Classes Under Closure Operations (Q2852612) (← links)
- Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity (Q2978174) (← links)
- Claw-free 3-connectedP11-free graphs are hamiltonian (Q3159394) (← links)
- On Forbidden Pairs Implying Hamilton‐Connectedness (Q4916093) (← links)
- Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs (Q4920656) (← links)
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs (Q5962521) (← links)
- Hamilton‐connected {claw,net}‐free graphs, II (Q6047639) (← links)
- Forbidden pairs of disconnected graphs for supereulerianity of connected graphs (Q6080121) (← links)
- Forbidden pairs of disconnected graphs for 2‐factor of connected graphs (Q6081558) (← links)
- Hamilton‐connected {claw, net}‐free graphs, I (Q6093143) (← links)
- 2-Trees: Structural insights and the study of Hamiltonian paths (Q6132868) (← links)
