Perfect matchings and K₁,p-restricted graphs

DOI10.1515/DMA-2020-0036MaRDI QIDQ1996835zbMATH OpenOpenAlexFDO

Authors Pavel A. Irzhavski, Yury L. Orlovich

Publication date 26 February 2021

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma-2020-0036

zbMATH Keywords

factor-critical graphperfect matchingstrongly \(K_{1, p}\)-restricted graph

Mathematics Subject Classification ID

Perfect graphs (05C17) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On perfect k-matchings
• A generalization of Petersen's matching theorem
• On the number of disjoint perfect matchings of regular graphs with given edge connectivity
• scientific article; zbMATH DE number 5016662
• Maximum matchings in a regular graph of specified connectivity and bounded order

Cites work

• 1-Factors and Antifactor Sets
• Almost claw‐free graphs
• Claw-free graphs---a survey
• Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
• Factors and factorizations of graphs. Proof techniques in factor theory
• Full cycle extendability of locally connected \(K_{1,4}\)-restricted graphs
• Fully cycle extendability of \(K_{1,4}\)-restricted graphs
• Graph factors and factorization: 1985--2003: a survey
• Graph Factors and Matching Extensions
• Graphs with 1-Factors
• Hamiltonicity in Partly claw-free graphs
• Hamiltonicity of 2-connected \(\{K_{1,4},K_{1,4}+e\}\)-free graphs
• Hamiltonicity of \(\{K_{1,4},K_{1,4}+e\}\)-free graphs
• scientific article; zbMATH DE number 46669 (Why is no real title available?)
• scientific article; zbMATH DE number 7492076 (Why is no real title available?)
• scientific article; zbMATH DE number 238423 (Why is no real title available?)
• Matching theory
• Quasi-claw-free graphs
• Remarks on regular factors of regular graphs
• The Factorization of Linear Graphs

Cited in

(7)

• A generalization of Petersen's matching theorem
• On perfect k-matchings
• Polyhedral Results for 1-Restricted Simple 2-Matchings
• Minimum codegree condition for perfect matchings in k‐partite k‐graphs
• scientific article; zbMATH DE number 2245640 (Why is no real title available?)
• Perfect matchings in graphs with prescribed local restrictions
• Restricted matching in graphs of small genus

This page was built for publication: Perfect matchings and \(K_{1,p}\)-restricted graphs

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