Perfect matchings and \(K_{1,p}\)-restricted graphs
type: Item
instance of: scholarly article
title: Perfect matchings and \(K_{1,p}\)-restricted graphs
zbMATH Open document ID: 1459.05261
author: Pavel A. Irzhavski
author: Yury L. Orlovich
published in: Discrete Mathematics and Applications
publication date: 2021-02-26T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C17
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7316005
zbMATH Keywords: strongly \(K_{1, p}\)-restricted graph
zbMATH Keywords: perfect matching
zbMATH Keywords: factor-critical graph
MaRDI profile type: Publication
full work available at URL: dma-2020-0036
OpenAlex ID: W3114954903
cites work: Matching theory
cites work: Graph factors and factorization: 1985--2003: a survey
cites work: Factors and factorizations of graphs. Proof techniques in factor theory
cites work: Graph Factors and Matching Extensions
cites work: Claw-free graphs---a survey
cites work: Hamiltonicity of \(\{K_{1,4},K_{1,4}+e\}\)-free graphs
cites work: Hamiltonicity of 2-connected \(\{K_{1,4},K_{1,4}+e\}\)-free graphs
cites work: Q5062716
cites work: Fully cycle extendability of \(K_{1,4}\)-restricted graphs
cites work: Q4691817
cites work: Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
cites work: Q3996859
cites work: Remarks on regular factors of regular graphs
cites work: Graphs with 1-Factors
cites work: 1-Factors and Antifactor Sets
cites work: Almost claw‐free graphs
cites work: Quasi-claw-free graphs
cites work: Hamiltonicity in Partly claw-free graphs
cites work: The Factorization of Linear Graphs
cites work: Q5287862
DOI: 10.1515/DMA-2020-0036
description: scientific article; zbMATH DE number 7316005