Pages that link to "Item:Q1367026"
From MaRDI portal
The following pages link to Characterizing forbidden pairs for hamiltonian properties (Q1367026):
Displaying 50 items.
- Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected (Q292269) (← links)
- Solution to a problem on Hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions (Q293647) (← links)
- Nowhere-zero 3-flows and \(Z_3\)-connectivity of graphs without two forbidden subgraphs (Q297939) (← links)
- Clique-heavy subgraphs and pancyclicity of 2-connected graphs (Q318913) (← links)
- Forbidden subgraphs for Hamiltonicity of 1-tough graphs (Q339484) (← links)
- Dominating cycles and forbidden pairs containing \(P_5\) (Q343722) (← links)
- Hamiltonian type properties in claw-free \(P_5\)-free graphs (Q343731) (← links)
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian (Q370939) (← links)
- Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs (Q383688) (← links)
- Forbidden subgraphs generating a finite set (Q383734) (← links)
- Forbidden subgraphs and the existence of a spanning tree without small degree stems (Q390302) (← links)
- Forbidden induced subgraphs for star-free graphs (Q409360) (← links)
- Pairs of forbidden induced subgraphs for homogeneously traceable graphs (Q449119) (← links)
- Forbidden pairs for spanning (closed) trails (Q512584) (← links)
- A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs (Q526255) (← links)
- Forbidden pairs with a common graph generating almost the same sets (Q528989) (← links)
- Forbidden subgraphs and the existence of spanning \(k\)-trees (Q607008) (← links)
- 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected (Q742625) (← links)
- Forbidden pairs for \(k\)-connected Hamiltonian graphs (Q764879) (← links)
- Characterizing forbidden pairs for Hamiltonian squares (Q897269) (← links)
- Claw-free and \(N(2,1,0)\)-free graphs are almost net-free (Q897278) (← links)
- Closure and forbidden pairs for 2-factors (Q968435) (← links)
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs (Q1297424) (← links)
- Forbidden triples and traceability: A characterization (Q1301658) (← links)
- Closure and forbidden pairs for Hamiltonicity (Q1403925) (← links)
- Traceability in graphs with forbidden triples of subgraphs (Q1584364) (← links)
- Forbidden pairs and the existence of a spanning Halin subgraph (Q1684949) (← links)
- Conditions for graphs to be path partition optimal (Q1709536) (← links)
- Forbidden pairs for equality of connectivity and edge-connectivity of graphs (Q1741581) (← links)
- Pairs of forbidden subgraphs and 2-connected supereulerian graphs (Q1744755) (← links)
- Forbidden subgraphs and weak locally connected graphs (Q1756128) (← links)
- Line graphs and forbidden induced subgraphs (Q1850532) (← links)
- Disconnected forbidden subgraphs, toughness and Hamilton cycles (Q1952726) (← links)
- Characterization of forbidden subgraphs for the existence of even factors in a graph (Q2030443) (← links)
- Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs (Q2043390) (← links)
- Toughness, forbidden subgraphs and pancyclicity (Q2045380) (← links)
- Ramsey-type results for path covers and path partitions (Q2094874) (← links)
- Results and problems on chorded cycles: a survey (Q2102760) (← 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)
- Hamiltonian extendable graphs (Q2151217) (← links)
- Forbidden subgraphs on Hamiltonian index (Q2174585) (← links)
- Forbidden subgraphs for supereulerian and Hamiltonian graphs (Q2208360) (← links)
- On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs (Q2214314) (← links)
- Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs (Q2219958) (← links)
- Nonempty intersection of longest paths in graphs without forbidden pairs (Q2231747) (← links)
- Implementation of RTO in a large hydrogen network considering uncertainty (Q2302370) (← links)
- On traceability of claw-\({o_{-1}}\)-heavy graphs (Q2316309) (← links)
- The local structure of claw-free graphs without induced generalized bulls (Q2334073) (← links)
- Forbidden quadruplets generating a finite set of 2-connected graphs (Q2342611) (← links)
