Closure and stable Hamiltonian properties in claw-free graphs
From MaRDI portal
Publication:4487073
DOI<30::AID-JGT4>3.0.CO;2-R 10.1002/(SICI)1097-0118(200005)34:1<30::AID-JGT4>3.0.CO;2-RzbMath0946.05053OpenAlexW4249665279MaRDI QIDQ4487073
Zdeněk Ryjáček, Stephan Brandt, Odile Favaron
Publication date: 18 October 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200005)34:1<30::aid-jgt4>3.0.co;2-r
closure operationclaw-free graphpancyclicitycycle extendabilityvertex pancyclicitystable propertyhomogeneous traceability
Related Items
Forbidden pairs of disconnected graphs for traceability in connected graphs, Characterizing forbidden pairs for relative length of longest paths and cycles, Extremal problems on the Hamiltonicity of claw-free graphs, Degree sums of adjacent vertices for traceability of claw-free graphs, The path partition conjecture is true for claw-free graphs, On sufficient degree conditions for traceability of claw-free graphs, On 1-Hamilton-connected claw-free graphs, Hamilton‐connected {claw, bull}‐free graphs, Hamilton‐connected {claw, net}‐free graphs, I, Closure and Hamilton-connected claw-free hourglass-free graphs, Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs, Cycles through given vertices and closures, On cycle lengths in claw-free graphs with complete closure, A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs, Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected, Closure operation for even factors on claw-free graphs, The \(*\)-closure for graphs and claw-free graphs, Degree conditions on induced claws, The existence of spanning ended system on claw-free graphs, Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs, Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs, On the independence number of traceable 2-connected claw-free graphs, Spanning trails in a 2-connected graph, Forbidden subgraphs, stability and hamiltonicity, Closure, stability and iterated line graphs with a 2-factor, Closure and Hamiltonian-connectivity of claw-free graphs
Cites Work
