scientific article; zbMATH DE number 4200251

MaRDI QIDQ3348939zbMATH OpenFDO

Authors Zdeněk Ryjáček

Publication date 1989

zbMATH Keywords

Hamiltonian graphpancyclic graph2-matchingHamiltonian circuit2- factor

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On connected factors in \(K_{1,3}\)-free graphs
• \(K_{1,3}\)-factors in graphs
• Regular factors in K_1,3‐free graphs
• On factorial subclasses of \(K_{1,3}\)-free graphs
• Existence of 3-factors in \(K_{1,n}\)-free graphs with connectivity and edge-connectivity conditions
• scientific article; zbMATH DE number 1150358
• Remarks on component factors in K_1,r-free graphs
• Regular factors in K_1,n free graphs
• Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor
• Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor

Cited in

(6)

• Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4
• \(K_{1,3}\)-factors in graphs
• Claw-free graphs---a survey
• Eliminating graphs by means of parallel knock-out schemes
• Regular factors in K_1,3‐free graphs
• Factors of claw-free graphs

This page was built for publication:

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