Matching extension in \(K_{1,r}\)-free graphs with independent claw centers

DOI10.1016/S0012-365X(96)00059-3zbMath0872.05044MaRDI QIDQ1356714

Zdeněk Ryjáček

Publication date: 10 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

perfect matchingclaw-free graphsindependent edges\(k\)-extendibilitycenters of claws

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

A characterization of maximal non-\(k\)-factor-critical graphs ⋮ The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness

Cites Work

• Unnamed Item
• Unnamed Item
• On maximal independent sets of vertices in claw-free graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• Extending matchings in graphs: A survey
• Extending matchings in claw-free graphs
• Graphs with 1-Factors
• 1-Factors and Antifactor Sets
• Almost claw‐free graphs

This page was built for publication: Matching extension in \(K_{1,r}\)-free graphs with independent claw centers