Hamiltonian results inK1,3-free graphs
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Bipartite toughness and \(k\)-factors in bipartite graphs
- On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs
- On a connection between the existence of k-trees and the toughness of a graph
- A large class of maximally tough graphs
- Hamiltonicity in claw-free graphs
- On connected factors in \(K_{1,3}\)-free graphs
- Forbidden triples and traceability: A characterization
- 9-connected claw-free graphs are Hamilton-connected
- Hamiltonicity of bipartite biclaw-free graphs
- Dirac's minimum degree condition restricted to claws
- Maximum and minimum toughness of graphs of small genus
- Claw-free graphs---a survey
- Hamiltonicity of 2-connected claw-center independent graphs
- On a closure concept in claw-free graphs
- The complexity of recognizing tough cubic graphs
- Hamiltonicity in 2-connected graphs with claws
- Graphs indecomposable with respect to the X-join
- Closure concepts for claw-free graphs
- Triangles in claw-free graphs
- Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
- Pancyclicity of 4-connected \(\{K_{1,3},Z_8\}\)-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
- Dominating cycles in bipartite biclaw-free graphs
- The toughness of cubic graphs
- Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs
- Hamiltonian cycles in regular 3-connected claw-free graphs
- On Hamiltonicity of 2-connected claw-free graphs
- Highly Hamiltonian \(K_{1,3}P_4\)-free graphs
- Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs
- Toughness, forbidden subgraphs and pancyclicity
- Connected even factors in \(k\)-tree
- Toughness, forbidden subgraphs, and Hamilton-connected graphs
- Complete family reduction and spanning connectivity in line graphs
- A condition on Hamilton-connected line graphs
- The Hamiltonian properties in \(K_{1,r}\)-free split graphs
- On cycle-nice claw-free graphs
- 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
- Cycle traversability for claw-free graphs and polyhedral maps
- On s-Hamiltonicity of net-free line graphs
- On the line graph of a graph with diameter 2
- The longest cycle problem is polynomial on interval graphs
- Spanning trees with few peripheral branch vertices
- Implementation of RTO in a large hydrogen network considering uncertainty
- On \(s\)-Hamiltonian line graphs of claw-free graphs
- Equivalence of Jackson's and Thomassen's conjectures
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs
- Long paths and cycles in tough graphs
- Tank-ring factors in supereulerian claw-free graphs
- Cycles through all finite vertex sets in infinite graphs
- Properties of minimally \(t\)-tough 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
- On the number of components in 2-factors of claw-free graphs
- Forbidden subgraphs that imply 2-factors
- Connected even factors in claw-free graphs
- 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
- The complexity of recognizing minimally tough graphs
- Polynomially determining spanning connectivity of locally connected line graphs
- Strongly even cycle decomposable 4-regular line graphs
- On the minimum degree of minimally 1-tough, triangle-free graphs and minimally 3/2-tough, claw-free graphs
- On factors of 4-connected claw-free graphs
- A note on hamiltonian cycles in \(K_{1,r}\)-free graphs
- Extending cycles locally to Hamilton cycles
- Hamilton cycles in 6-connected claw-free graphs (extended abstract)
- 2-factors in claw-free graphs
- Maximal K₃'s and hamiltonicity of 4-connected claw-free graphs
- Claw-free graphs and 2-factors that separate independent vertices
- Hamiltonian cycles in spanning subgraphs of line graphs
- Minimum implicit degree condition restricted to claws for Hamiltonian cycles
- Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs
- Forbidden subgraphs for Hamiltonicity of 1-tough graphs
- Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs
- Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks
- On the Toughness of a Graph
- Hamiltonicity of Complements of Total Graphs
- Computing Sharp 2-Factors in Claw-Free Graphs
- Hamiltonicity in Partly claw-free graphs
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- scientific article; zbMATH DE number 4108813 (Why is no real title available?)
- Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs
- Circumferences of 2-factors in claw-free graphs
- Cycles in squares of trees without generalized claws
- scientific article; zbMATH DE number 1187330 (Why is no real title available?)
- Induced hourglass and the equivalence between Hamiltonicity and supereulerianity in claw-free graphs
- Set graphs. IV. Further connections with claw-freeness
- The spectrum and toughness of regular graphs
This page was built for publication: Hamiltonian results inK1,3-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3320427)
