Pages that link to "Item:Q2477381"

The following pages link to Forbidden subgraphs that imply 2-factors (Q2477381):

Displaying 20 items.

• Hamiltonian claw-free graphs and \(o\)-heavy graphs involving induced cycles (Q295270) (← links)
• Endpoint extendable paths in dense graphs (Q442374) (← links)
• Pairs of forbidden induced subgraphs for homogeneously traceable graphs (Q449119) (← links)
• Forbidden pairs for \(k\)-connected Hamiltonian graphs (Q764879) (← links)
• Closure and forbidden pairs for 2-factors (Q968435) (← links)
• On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs (Q1012442) (← links)
• Forbidden subgraphs for existences of (connected) 2-factors of a graph (Q2107755) (← links)
• Characterizing forbidden pairs for relative length of longest paths and cycles (Q2138962) (← links)
• Closure operation for even factors on claw-free graphs (Q2275395) (← links)
• On 2-factors with a bounded number of odd components (Q2439124) (← links)
• Forbidden pairs and the existence of a dominating cycle (Q2515588) (← 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)
• A Pair of Forbidden Subgraphs and 2-Factors (Q2883858) (← links)
• 2-Factors in claw-free graphs with locally disconnected vertices (Q2947989) (← links)
• Forbidden subgraphs and the existence of a 2-factor (Q3055922) (← links)
• Tree in forbidden triples generating a finite set of graphs with high connectivity (Q5154610) (← links)
• Forbidden subgraphs for graphs with (near) perfect matching to be hamiltonian (Q5163018) (← 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)