Closure and stable Hamiltonian properties in claw-free graphs

DOI10.1002/(SICI)1097-0118(200005)34:1%3C30::AID-JGT4%3E3.0.CO;2-RMaRDI QIDQ4487073zbMATH OpenOpenAlexFDO

Authors Stephan Brandt, Zdeněk Ryjáček, Odile Favaron

Publication date 18 October 2000

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(200005)34:1%3C30::aid-jgt4%3E3.0.co;2-r

zbMATH Keywords

claw-free graphclosure operationpancyclicitycycle extendabilityvertex pancyclicitystable propertyhomogeneous traceability

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Closure and Hamiltonian-connectivity of claw-free graphs
• On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs

Cites work

• Graph theory with applications

Cited in

(33)

• On 1-Hamilton-connected claw-free graphs
• Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
• On cycle lengths in claw-free graphs with complete closure
• Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
• Cycles through given vertices and closures
• A closure for Hamilton-connectedness in \(\{K_{1,3}, \Gamma_3\}\)-free graphs
• Characterizing forbidden pairs for relative length of longest paths and cycles
• Degree sums of adjacent vertices for traceability of claw-free graphs
• A closure for 1-Hamilton-connectedness in claw-free graphs
• On stability of the spanning trial under the closure
• Closure, stability and iterated line graphs with a 2-factor
• Hamilton‐connected {claw, bull}‐free graphs
• Hamilton‐connected {claw, net}‐free graphs, I
• On the independence number of traceable 2-connected claw-free graphs
• The \(*\)-closure for graphs and claw-free graphs
• Closure operation for even factors on claw-free graphs
• Degree conditions on induced claws
• Closure and Hamiltonian-connectivity of claw-free graphs
• Extremal problems on the Hamiltonicity of claw-free graphs
• Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs
• Stability of hereditary graph classes under closure operations
• Closure and Hamilton-connected claw-free hourglass-free graphs
• The existence of spanning ended system on claw-free graphs
• A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence
• Forbidden subgraphs, stability and hamiltonicity
• The path partition conjecture is true for claw-free graphs
• Every 3-connected \(\{K_{1, 3}, \Gamma_3\}\)-free graph is Hamilton-connected
• On sufficient degree conditions for traceability of claw-free graphs
• On stability of the Hamiltonian index under cycle closure
• Spanning trails in a 2-connected graph
• Forbidden pairs of disconnected graphs for traceability in connected 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

This page was built for publication: Closure and stable Hamiltonian properties in claw-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4487073)