Pages that link to "Item:Q1362093"
From MaRDI portal
The following pages link to On a closure concept in claw-free graphs (Q1362093):
Displaying 50 items.
- Circumferences of 3-connected claw-free graphs (Q267172) (← links)
- Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs (Q287897) (← links)
- A twelve vertex theorem for 3-connected claw-free graphs (Q292255) (← links)
- Solution to a problem on Hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions (Q293647) (← links)
- A note on edge-disjoint Hamilton cycles in line graphs (Q295256) (← links)
- Hamiltonian claw-free graphs and \(o\)-heavy graphs involving induced cycles (Q295270) (← links)
- Hamiltonian cycles in spanning subgraphs of line graphs (Q298990) (← links)
- Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs (Q327292) (← links)
- Generalization of matching extensions in graphs. IV: Closures (Q343759) (← links)
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs (Q345079) (← links)
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian (Q370939) (← links)
- Circumferences of 2-factors in claw-free graphs (Q383757) (← links)
- On 1-Hamilton-connected claw-free graphs (Q394533) (← links)
- Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs (Q400354) (← links)
- Hamilton cycles in 5-connected line graphs (Q412285) (← links)
- On 3-connected Hamiltonian line graphs (Q427827) (← links)
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs (Q432724) (← links)
- Collapsible graphs and Hamiltonian connectedness of line graphs (Q444449) (← links)
- On 2-factors in claw-free graphs whose edges are in small cycles (Q456652) (← links)
- 2-factors in claw-free graphs with lower bounds cycle lengths (Q489345) (← links)
- Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs (Q503616) (← links)
- Forbidden pairs for spanning (closed) trails (Q512584) (← links)
- Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs (Q523723) (← links)
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
- The spanning connectivity of line graphs (Q548422) (← links)
- Hamiltonicity of 6-connected line graphs (Q608282) (← links)
- A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence (Q626786) (← links)
- Group connectivity in line graphs (Q641209) (← links)
- 2-factors and independent sets on claw-free graphs (Q658040) (← links)
- On 3-edge-connected supereulerian graphs (Q659686) (← links)
- How many conjectures can you stand? A survey (Q659764) (← links)
- A note on degree conditions for traceability in locally claw-free graphs (Q691626) (← links)
- What is on his mind? (Q709300) (← links)
- Hamiltonicity of 3-connected line graphs (Q712614) (← links)
- On 3-stable number conditions in \(n\)-connected claw-free graphs (Q724867) (← links)
- The Ryjáček closure and a forbidden subgraph (Q726640) (← links)
- Collapsible graphs and Hamiltonicity of line graphs (Q742590) (← links)
- On Hamiltonicity of 3-connected claw-free graphs (Q742642) (← links)
- Forbidden pairs for \(k\)-connected Hamiltonian graphs (Q764879) (← links)
- Normal Eulerian clique-covering and hamiltonicity (Q765520) (← links)
- Stability results on the circumference of a graph (Q783243) (← links)
- Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs (Q844222) (← links)
- Quadrangularly connected claw-free graphs (Q870987) (← links)
- The path partition conjecture is true for claw-free graphs (Q878616) (← links)
- Closure and Hamilton-connected claw-free hourglass-free graphs (Q897238) (← links)
- On cycle lengths in claw-free graphs with complete closure (Q960969) (← links)
- Closure and forbidden pairs for 2-factors (Q968435) (← links)
- Closure concept for 2-factors in claw-free graphs (Q968436) (← links)
- The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs (Q973108) (← links)
- Computing sharp 2-factors in claw-free graphs (Q988693) (← links)
