On a closure concept in claw-free graphs
From MaRDI portal
If \(G\) is a claw-free graph, then there is a graph \(cl(G)\) such that (i) \(G\) is a spanning subgraph of \(cl(G)\), (ii) \(cl(G)\) is a line graph of a triangle-free graph, and (iii) the length of a longest cycle in \(G\) and in \(cl(G)\) is the same. A sufficient condition for hamiltonicity in claw-free graphs, the equivalence of some conjectures on hamiltonicity in 2-tough graphs and the hamiltonicity of 7-connected claw-free graphs are obtained as corollaries.
Recommendations
Cites work
- 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
- scientific article; zbMATH DE number 1409241 (Why is no real title available?)
- 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)- Circumferences and minimum degrees in 3-connected claw-free graphs
- Closure, stability and iterated line graphs with a 2-factor
- Forbidden subgraphs, stability and hamiltonicity
- Closure and Hamiltonian-connectivity of claw-free graphs
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- 9-connected claw-free graphs are Hamilton-connected
- Closure and forbidden pairs for Hamiltonicity
- Cycles through given vertices and closures
- Closure concepts for claw-free graphs
- Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
- Extremal problems on the Hamiltonicity of claw-free graphs
- Hamiltonicity of claw-free graphs and Fan-type conditions
- Pancyclicity of 4-connected \(\{K_{1,3},Z_8\}\)-free graphs
- Depth first search in claw-free graphs
- Pairs of forbidden subgraphs and 2-connected supereulerian graphs
- Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
- Every 3-connected essentially 10-connected line graph is Hamilton-connected
- The existence of spanning ended system on claw-free graphs
- Line graphs and forbidden induced subgraphs
- Hamiltonicity and minimum degree in 3-connected claw-free graphs
- All 4-connected line graphs of claw free graphs are Hamiltonian connected
- On Hamiltonicity of 2-connected claw-free graphs
- Exact algorithms for finding longest cycles in claw-free graphs
- Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
- Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs
- Induced nets and Hamiltonicity of claw-free graphs
- Supereulerian line graphs
- Complete family reduction and spanning connectivity in line graphs
- A condition on Hamilton-connected line graphs
- Forbidden subgraphs for collapsible graphs and supereulerian graphs
- Hamiltonian line graphs with local degree conditions
- Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II
- Characterizing forbidden pairs for relative length of longest paths and cycles
- Hamilton-connectivity of line graphs with application to their detour index
- On the s-hamiltonianicity of an hourglass-free line graph
- A note on 3-connected hourglass-free claw-free Hamilton-connected graphs
- On Hamiltonicity of regular graphs with bounded second neighborhoods
- Hamilton cycles in line graphs of 3-hypergraphs
- Thomassen's conjecture for line graphs of 3-hypergraphs
- A note on singular edges and Hamiltonicity in claw-free graphs with locally disconnected vertices
- On sufficient degree conditions for traceability of claw-free graphs
- The formula for Turán number of spanning linear forests
- Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs
- On s-Hamiltonicity of net-free line graphs
- On the line graph of a graph with diameter 2
- Lai's conditions for spanning and dominating closed trails
- Closure operation for even factors on claw-free graphs
- 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices
- On the independence number of traceable 2-connected claw-free graphs
- Spanning trails in a 2-connected graph
- The local structure of claw-free graphs without induced generalized bulls
- Equivalence of Jackson's and Thomassen's conjectures
- Hamiltonian claw-free graphs with locally disconnected vertices
- A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs
- Circumferences of 3-connected claw-free graphs. II.
- Forbidden pairs of disconnected graphs for traceability in connected graphs
- Even factors with a bounded number of components in iterated line graphs
- Heavy subgraphs, stability and Hamiltonicity
- Tank-ring factors in supereulerian claw-free graphs
- Hamiltonian paths in spanning subgraphs of line graphs
- Cycles through all finite vertex sets in infinite graphs
- Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
- Hamiltonicities of double domination critical and stable claw-free graphs
- Hamiltonian connected hourglass free line graphs
- Group connectivity and group colorings of graphs --- a survey
- Circumferences of regular claw-free graphs
- On Hamiltonicity of \{claw, net\}-free graphs
- On 2-factors with a bounded number of odd components
- Recent advances on the Hamiltonian problem: survey III
- Hamiltonian claw-free graphs involving minimum degrees
- Even subgraphs of bridgeless graphs and 2-factors of line graphs
- On the number of components in 2-factors of claw-free graphs
- Forbidden subgraphs that imply 2-factors
- Toughness in graphs -- a survey
- Hamiltonicity in 3-connected claw-free graphs
- Every 3-connected, essentially 11-connected line graph is Hamiltonian
- 2-factors with bounded number of components in claw-free graphs
- Forbidden pairs and the existence of a dominating cycle
- Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs
- Polynomially determining spanning connectivity of locally connected line graphs
- Strongly even cycle decomposable 4-regular line graphs
- Circumferences of 3-connected claw-free graphs
- Two completely independent spanning trees of claw-free graphs
- On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs
- Edge-dominating trails in AT-free graphs (extended abstract)
- On factors of 4-connected claw-free graphs
- Quartic graphs with every edge in a triangle
- The edge-closure of a claw-free graph is the line graph of a multigraph.
- Hamilton cycles in 6-connected claw-free graphs (extended abstract)
- Stability of hereditary graph classes under closure operations
- 2-factors in claw-free graphs
- Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Maximal K₃'s and hamiltonicity of 4-connected claw-free graphs
- Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
- Claw-free graphs and 2-factors that separate independent vertices
- A twelve vertex theorem for 3-connected claw-free graphs
- Supereulerian graphs with small matching number and 2-connected Hamiltonian claw-free graphs
- Solution to a problem on Hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions
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)
