On a closure concept in claw-free graphs
From MaRDI portal
Publication:1362093
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)- Collapsible graphs and Hamiltonian connectedness of line graphs
- How many conjectures can you stand? A survey
- Circumferences and minimum degrees in 3-connected claw-free graphs
- Claw-free graphs and 2-factors that separate independent vertices
- Closure and Hamiltonian-connectivity of claw-free graphs
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- Forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs
- 2-factors with bounded number of components in claw-free graphs
- Recent advances on the Hamiltonian problem: survey III
- The \(*\)-closure for graphs and claw-free graphs
- On 1-Hamilton-connected claw-free graphs
- Generalization of matching extensions in graphs. IV: Closures
- Hamiltonicity and minimum degree in 3-connected claw-free graphs
- Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
- A twelve vertex theorem for 3-connected claw-free graphs
- Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II
- Claw-free graphs with complete closure
- On hamiltonian line graphs of hypergraphs
- Line graphs and forbidden induced subgraphs
- Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs
- Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- On 3-connected Hamiltonian line graphs
- Circumferences of regular claw-free graphs
- Toughness in graphs -- a survey
- Forbidden pairs of disconnected graphs for traceability in connected graphs
- On the number of components in 2-factors of claw-free graphs
- Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs
- Hamiltonicity of 3-connected line graphs
- Induced nets and Hamiltonicity of claw-free graphs
- 2-factors in claw-free graphs
- On Hamiltonicity of 3-connected claw-free graphs
- Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs
- Closure operation for even factors on claw-free graphs
- Forbidden subgraphs that imply 2-factors
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
- Group connectivity and group colorings of graphs --- a survey
- 2-factors and independent sets on claw-free graphs
- Circumferences of 2-factors in claw-free graphs
- Hamilton cycles in claw-free graphs
- What is on his mind?
- Hamilton cycles in line graphs of 3-hypergraphs
- Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
- Every 3-connected essentially 10-connected line graph is Hamilton-connected
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
- Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs
- Path-comprehensive and vertex-pancyclic properties of super line graph \(\mathcal L_2(G)\)
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
- Every 3-connected, essentially 11-connected line graph is Hamiltonian
- Circumferences of 3-connected claw-free graphs. II.
- All 4-connected line graphs of claw free graphs are Hamiltonian connected
- Even subgraphs of bridgeless graphs and 2-factors of line graphs
- Every 3-connected claw-free \(Z_{8}\)-free graph is Hamiltonian
- A closure for 1-Hamilton-connectedness in claw-free graphs
- Hamiltonicity of 6-connected line graphs
- The path partition conjecture is true for claw-free graphs
- Forbidden pairs and the existence of a dominating cycle
- Hamiltonian claw-free graphs with locally disconnected vertices
- Hamilton cycles in 5-connected line graphs
- Hamiltonian paths in spanning subgraphs of line graphs
- Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs
- Hamiltonicity in 3-connected claw-free graphs
- Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- Forbidden subgraphs for collapsible graphs and supereulerian graphs
- Hamiltonian claw-free graphs involving minimum degrees
- Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Circumferences of 3-connected claw-free graphs
- 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
- On factors of 4-connected claw-free graphs
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
- Hamiltonian cycles in spanning subgraphs of line graphs
- Degree conditions on induced claws
- On 2-factors in claw-free graphs whose edges are in small cycles
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
- 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
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)
