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)- Computing sharp 2-factors in claw-free graphs
- Computing Sharp 2-Factors in Claw-Free Graphs
- A note on 3-connected hourglass-free claw-free Hamilton-connected graphs
- Forbidden pairs of disconnected graphs implying Hamiltonicity
- Lai's conditions for spanning and dominating closed trails
- Exact algorithms for finding longest cycles in claw-free graphs
- A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence
- Normal Eulerian clique-covering and hamiltonicity
- A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs
- Forbidden subgraphs, stability and hamiltonicity
- Hamiltonicities of double domination critical and stable claw-free graphs
- On the independence number of traceable 2-connected claw-free graphs
- 9-connected claw-free graphs are Hamilton-connected
- On the line graph of a graph with diameter 2
- Forbidden pairs for \(k\)-connected Hamiltonian graphs
- Even factors with a bounded number of components in iterated line graphs
- The Ryjáček closure and a forbidden subgraph
- Stability results on the circumference of a graph
- A condition on Hamilton-connected line graphs
- Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
- Pancyclicity of 4-connected, claw-free, \(P_{10}\)-free graphs
- A note on degree conditions for traceability in locally claw-free graphs
- Characterizing forbidden pairs for relative length of longest paths and cycles
- On \(s\)-Hamiltonicity of net-free line graphs
- scientific article; zbMATH DE number 1735795 (Why is no real title available?)
- Supereulerian graphs with small matching number and 2-connected Hamiltonian claw-free graphs
- 2-factors in claw-free graphs with lower bounds cycle lengths
- Closure and Hamilton-connected claw-free hourglass-free graphs
- On components of 2-factors in claw-free graphs
- Quadrangularly connected claw-free graphs
- Closure and forbidden pairs for 2-factors
- Closure concept for 2-factors in claw-free graphs
- On 3-stable number conditions in \(n\)-connected claw-free graphs
- On 3-edge-connected supereulerian graphs
- The edge-closure concept for claw-free graphs and the stability of forbidden subgraphs
- Group connectivity in line graphs
- On Hamiltonicity of 2-connected claw-free graphs
- Chvátal's \(t_{0}\)-tough conjecture
- The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs
- On dominating even subgraphs in cubic graphs
- Cycles through given vertices and closures
- Closure concepts for claw-free graphs
- Hamiltonicity in Partly claw-free graphs
- Hamilton‐connected {claw, bull}‐free graphs
- Hamilton‐connected {claw, net}‐free graphs, I
- Collapsible graphs and Hamiltonicity of line graphs
- Closure, stability and iterated line graphs with a 2-factor
- Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
- Forbidden pairs for spanning (closed) trails
- On cycle lengths in claw-free graphs with complete closure
- Closure and forbidden pairs for Hamiltonicity
- Hamilton cycles in 6-connected claw-free graphs (extended abstract)
- Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
- A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs
- The spanning connectivity of line graphs
- On Hamiltonicity of \{claw, net\}-free graphs
- Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
- A closure for Hamilton-connectedness in \(\{K_{1,3}, \Gamma_3\}\)-free graphs
- On stability of the spanning trial under the closure
- On 2-factors with a specified number of components in line graphs
- Hamiltonian line graphs with local degree conditions
- Minimal 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
- Pancyclicity of 4-connected \(\{K_{1,3},Z_8\}\)-free graphs
- A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs
- Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs
- Extremal problems on the Hamiltonicity of claw-free graphs
- Compatible spanning circuits and forbidden induced subgraphs
- 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices
- Maximal \(K_3\)'s and hamiltonicity of 4-connected claw-free graphs
- Strongly even cycle decomposable 4-regular line graphs
- 2-factors in claw-free graphs with locally disconnected vertices.
- Equivalence of Jackson's and Thomassen's conjectures
- Tank-ring factors in supereulerian claw-free graphs
- Heavy subgraphs, stability and Hamiltonicity
- Perfect matching transitivity of circulant graphs
- Hamilton-connected claw-free graphs with Ore-degree conditions
- Spanning trails in a 2-connected graph
- Good orientations of unions of edge‐disjoint spanning trees
- Quartic graphs with every edge in a triangle
- Hamilton circuits and essential girth of claw free graphs
- Every 3-connected \(\{K_{1, 3}, \Gamma_3\}\)-free graph is Hamilton-connected
- Every 2-connected \(\{\text{claw}, Z_2\}\)-free graph with minimum degree at least 4 contains two CISTs
- Hamiltonicity of claw-free graphs and Fan-type conditions
- Circumference of essentially 4-connected planar triangulations
- Thomassen's conjecture for line graphs of 3-hypergraphs
- Induced disjoint paths in claw-free graphs
- Cycles through all finite vertex sets in infinite graphs
- Characterization of perfect matching transitive graphs
- On 2-factors with a bounded number of odd components
- Polynomially determining spanning connectivity of locally connected line graphs
- Forbidden pairs of disconnected graphs for 2‐factor of connected graphs
- Hamiltonian connected hourglass free line graphs
- A note on singular edges and Hamiltonicity in claw-free graphs with locally disconnected vertices
- Degree sums of adjacent vertices for traceability of claw-free graphs
- Perfect pseudo-matchings in cubic graphs
- On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs
- Depth first search in 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)
