\(K_{1,3}\)-factors in graphs
type: Item
instance of: scholarly article
title: \(K_{1,3}\)-factors in graphs
zbMATH Open document ID: 1204.05075
author: Yoshimi Egawa
author: Shinya Fujita
author: Katsuhiro Ota
published in: Discrete Mathematics
publication date: 2009-01-28T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5499738
zbMATH Keywords: claw
zbMATH Keywords: vertex-disjoint subgraphs
zbMATH Keywords: factor
zbMATH Keywords: minimum degree
MaRDI profile type: Publication
full work available at URL: j.disc.2007.11.013
OpenAlex ID: W2055226951
cites work: On the maximal number of independent circuits in a graph
cites work: Vertex-disjoint claws in graphs
cites work: On circuits in graphs
cites work: Q3211348
cites work: Q5620621
cites work: K4−‐factor in a graph
cites work: Proof of the Alon-Yuster conjecture
cites work: An El-Zah�r type condition ensuring path-factors
DOI: 10.1016/J.DISC.2007.11.013
Recommended article: Q3348939
Recommended article: On connected factors in \(K_{1,3}\)-free graphs
Recommended article: Regular factors in K1,3‐free graphs
Recommended article: Q5263838
Recommended article: Q3576688
Recommended article: \(k\) -factors in regular graphs
Recommended article: Q5016980
Recommended article: Q5398507
Recommended article: Q4901058
Recommended article: Connected \([k,k+1]\)-factors of graphs
description: scientific article; zbMATH DE number 5499738