Perfect matchings and \(K_{1,p}\)-restricted graphs
From MaRDI portal
Publication:1996835
DOI10.1515/dma-2020-0036zbMath1459.05261OpenAlexW3114954903MaRDI QIDQ1996835
Yury L. Orlovich, Pavel A. Irzhavski
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Perfect graphs (05C17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factors and factorizations of graphs. Proof techniques in factor theory
- Graph factors and factorization: 1985--2003: a survey
- Fully cycle extendability of \(K_{1,4}\)-restricted graphs
- Matching theory
- Hamiltonicity of \(\{K_{1,4},K_{1,4}+e\}\)-free graphs
- Claw-free graphs---a survey
- Quasi-claw-free graphs
- Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
- Hamiltonicity of 2-connected \(\{K_{1,4},K_{1,4}+e\}\)-free graphs
- Graph Factors and Matching Extensions
- Hamiltonicity in Partly claw-free graphs
- Graphs with 1-Factors
- Remarks on regular factors of regular graphs
- 1-Factors and Antifactor Sets
- Almost claw‐free graphs
- The Factorization of Linear Graphs
