On a closure concept in claw-free graphs

DOI10.1006/JCTB.1996.1732zbMATH Open0872.05032OpenAlexW1967979192MaRDI QIDQ1362093FDOQ1362093

Authors: Zdeněk Ryjáček 

Publication date: 12 August 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1996.1732

Recommendations

• Claw-free graphs with complete closure
• Closure and Hamiltonian-connectivity of claw-free graphs
• On graph closures

zbMATH Keywords

claw-free graphhamiltonicity

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Graph theory
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• Hamiltonian results inK1,3-free graphs
• Reflections on graph theory
• On hamiltonian line graphs and connectivity
• Tough graphs and Hamiltonian circuits.
• Title not available (Why is that?)
• Hamiltonian circuits in N₂‐locally connected K_1,3‐free graphs
• Toughness and the existence ofk-factors

Cited In (only showing first 100 items - show all)

• On 1-Hamilton-connected claw-free graphs
• Toughness in graphs -- a survey
• Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
• Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs
• Circumferences of 3-connected claw-free graphs
• How many conjectures can you stand? A survey
• Forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs
• Recent advances on the Hamiltonian problem: survey III
• Hamiltonicity of 6-connected line 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
• 2-factors with bounded number of components in claw-free graphs
• Claw-free graphs with complete closure
• Circumferences and minimum degrees in 3-connected claw-free graphs
• On 3-connected Hamiltonian line graphs
• 2-factors in claw-free graphs
• Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
• 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
• Hamilton cycles in claw-free graphs
• A closure for 1-Hamilton-connectedness in 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
• Hamiltonian cycles in spanning subgraphs of line 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
• On the number of components in 2-factors of claw-free graphs
• Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
• On Hamiltonicity of 3-connected claw-free graphs
• Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs
• Hamiltonicity of 3-connected line graphs
• Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
• Claw-free graphs and 2-factors that separate independent vertices
• The \(*\)-closure for graphs and claw-free graphs
• On hamiltonian line graphs of hypergraphs
• Closure operation for even factors on claw-free graphs
• Degree conditions on induced claws
• On 2-factors in claw-free graphs whose edges are in small cycles
• Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs
• Closure and Hamiltonian-connectivity of claw-free graphs
• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
• Circumferences of 3-connected claw-free graphs. II.
• All 4-connected line graphs of claw free graphs are Hamiltonian connected
• Circumferences of regular claw-free graphs
• Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs
• Hamiltonicity in 3-connected claw-free graphs
• On factors of 4-connected claw-free graphs
• Hamiltonian claw-free graphs with locally disconnected vertices
• Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
• Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
• Every 3-connected essentially 10-connected line graph is Hamilton-connected
• Every 3-connected claw-free \(Z_{8}\)-free graph is Hamiltonian
• The path partition conjecture is true for claw-free graphs
• Generalization of matching extensions in graphs. IV: Closures
• Line graphs and forbidden induced subgraphs
• What is on his mind?
• Group connectivity and group colorings of graphs --- a survey
• Hamilton cycles in line graphs of 3-hypergraphs
• Path-comprehensive and vertex-pancyclic properties of super line graph \(\mathcal L_2(G)\)
• Forbidden subgraphs for collapsible graphs and supereulerian graphs
• Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs
• Hamiltonian paths in spanning subgraphs of line graphs
• Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
• Forbidden subgraphs that imply 2-factors
• Every 3-connected, essentially 11-connected line graph is Hamiltonian
• Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
• Forbidden pairs of disconnected graphs for traceability in connected graphs
• Hamiltonian claw-free graphs involving minimum degrees
• Induced nets and Hamiltonicity of claw-free graphs
• Circumferences of 2-factors in claw-free graphs
• Hamiltonicity and restricted degree conditions on induced subgraphs in claw-free graphs. II
• Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
• On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
• 2-factors and independent sets on claw-free graphs
• Hamiltonicity and minimum degree in 3-connected claw-free graphs
• On cycle lengths in claw-free graphs with complete closure
• Supereulerian graphs with small matching number and 2-connected Hamiltonian claw-free graphs
• A condition on Hamilton-connected line graphs
• A note on degree conditions for traceability in locally claw-free 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
• Hamilton cycles in 6-connected claw-free graphs (extended abstract)
• On the line graph of a graph with diameter 2
• Forbidden pairs of disconnected graphs implying Hamiltonicity
• On \(s\)-Hamiltonicity of net-free line graphs
• Cycles through given vertices and closures
• Characterizing forbidden pairs for relative length of longest paths and cycles
• On 3-stable number conditions in \(n\)-connected claw-free graphs
• On Hamiltonicity of 2-connected claw-free graphs
• Closure concepts for claw-free graphs
• Exact algorithms for finding longest cycles in claw-free graphs
• Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
• On components of 2-factors in claw-free graphs
• Hamilton‐connected {claw, bull}‐free graphs
• Hamilton‐connected {claw, net}‐free graphs, I

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)