Recommendations
Cites work
- scientific article; zbMATH DE number 1409241 (Why is no real title available?)
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Graph theory
- Hamiltonian circuits in N2‐locally connected K1,3‐free graphs
- Hamiltonian results inK1,3-free graphs
- On hamiltonian line graphs and connectivity
- Reflections on graph theory
- Tough graphs and Hamiltonian circuits.
- Toughness and the existence ofk-factors
Cited in
(only showing first 100 items - show all)- On 1-Hamilton-connected claw-free graphs
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
- Toughness in graphs -- a survey
- Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs
- Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
- Hamiltonicity of claw-free graphs and Fan-type conditions
- Minimal claw-free graphs
- Circumferences of 3-connected claw-free graphs
- On cycle lengths in claw-free graphs with complete closure
- How many conjectures can you stand? A survey
- Supereulerian graphs with small matching number and 2-connected Hamiltonian claw-free graphs
- Pancyclicity of 4-connected \(\{K_{1,3},Z_8\}\)-free graphs
- A note on degree conditions for traceability in locally claw-free graphs
- Heavy subgraphs, stability and Hamiltonicity
- A condition on Hamilton-connected line graphs
- Closure and forbidden pairs for 2-factors
- Closure concept for 2-factors in claw-free graphs
- The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs
- On 2-factors with long cycles in 3-connected claw-free graphs
- The local structure of claw-free graphs without induced generalized bulls
- Edge-dominating trails in AT-free graphs (extended abstract)
- Hamilton cycles in 6-connected claw-free graphs (extended abstract)
- Recent advances on the Hamiltonian problem: survey III
- On the line graph of a graph with diameter 2
- 2-factors in claw-free graphs with locally disconnected vertices.
- Hamiltonicity of 6-connected line graphs
- Forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs
- Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
- Forbidden pairs and the existence of a dominating cycle
- Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
- Even subgraphs of bridgeless graphs and 2-factors of line graphs
- Hamilton circuits and essential girth of claw free graphs
- Characterization of perfect matching transitive graphs
- 2-factors with bounded number of components in claw-free graphs
- Forbidden pairs of disconnected graphs implying Hamiltonicity
- On s-Hamiltonicity of net-free line graphs
- Depth first search in claw-free graphs
- Pairs of forbidden subgraphs and 2-connected supereulerian graphs
- Circumferences and minimum degrees in 3-connected claw-free graphs
- Claw-free graphs with complete closure
- On 3-connected Hamiltonian line graphs
- Hamiltonian line graphs with local degree conditions
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
- 2-factors in claw-free graphs
- Cycles through all finite vertex sets in infinite graphs
- Cycles through given vertices and closures
- Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- A twelve vertex theorem for 3-connected claw-free graphs
- A closure for Hamilton-connectedness in \(\{K_{1,3}, \Gamma_3\}\)-free graphs
- On 3-stable number conditions in \(n\)-connected claw-free graphs
- Characterizing forbidden pairs for relative length of longest paths and cycles
- Solution to a problem on Hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions
- A note on edge-disjoint Hamilton cycles in line graphs
- Hamiltonian claw-free graphs and \(o\)-heavy graphs involving induced cycles
- Hamiltonian cycles in spanning subgraphs of line graphs
- On Hamiltonicity of 2-connected claw-free graphs
- Hamilton cycles in claw-free graphs
- Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
- A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs
- Degree sums of adjacent vertices for traceability of claw-free graphs
- A closure for 1-Hamilton-connectedness in claw-free graphs
- Hamilton cycles in 5-connected line graphs
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
- Collapsible graphs and Hamiltonian connectedness of line graphs
- Closure concepts for claw-free graphs
- Exact algorithms for finding longest cycles in claw-free graphs
- On stability of the spanning trial under the closure
- On the number of components in 2-factors of claw-free graphs
- Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
- Closure, stability and iterated line graphs with a 2-factor
- On components of 2-factors in claw-free graphs
- The formula for Turán number of spanning linear forests
- On Hamiltonicity of 3-connected claw-free graphs
- Hamilton-connectivity of line graphs with application to their detour index
- On the s-hamiltonianicity of an hourglass-free line graph
- On Hamiltonicity of regular graphs with bounded second neighborhoods
- Thomassen's conjecture for line graphs of 3-hypergraphs
- Hamilton‐connected {claw, bull}‐free graphs
- Hamilton‐connected {claw, net}‐free graphs, I
- Polynomially determining spanning connectivity of locally connected line graphs
- Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs
- Good orientations of unions of edge‐disjoint spanning trees
- Hamiltonicity of 3-connected line graphs
- On the independence number of traceable 2-connected claw-free graphs
- Hamiltonicities of double domination critical and stable claw-free graphs
- The \(*\)-closure for graphs and claw-free graphs
- The Ryjáček closure and a forbidden subgraph
- On Hamiltonicity of \{claw, net\}-free graphs
- Claw-free graphs and 2-factors that separate independent vertices
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
- Closure operation for even factors on claw-free graphs
- On 2-factors in claw-free graphs whose edges are in small cycles
- On 2-factors with a bounded number of odd components
- Degree conditions on induced claws
- Hamiltonian connected hourglass free line graphs
- Compatible spanning circuits and forbidden induced subgraphs
- On hamiltonian line graphs of hypergraphs
- Tank-ring factors in supereulerian claw-free graphs
This page was built for publication: On a closure concept in claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362093)
