Vertex-disjoint claws in graphs
type: Item
instance of: scholarly article
title: Vertex-disjoint claws in graphs
zbMATH Open document ID: 0934.05077
DOI: 10.1016/S0012-365X(99)90069-9
author: Yoshimi Egawa
author: Katsuhiro Ota
published in: Discrete Mathematics
publication date: 2000-04-10T00:00:00Z
review text: Let \(\delta(G)\) denote the minimum degree of a graph \(G\). The authors prove that a graph \(G\) of order at least \(4k+6\) with \(\delta(G)\geq k+2\) contains \(k\) pairwise vertex-disjoint \(K_{1,3}\)'s. The conditions on the minimum degree and on the order of the graph are best possible in a sense.
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1322015
zbMATH Keywords: factor
zbMATH Keywords: claws
zbMATH Keywords: minimum degree
MaRDI profile type: Publication
cites work: \(H\)-factors in dense graphs
cites work: On the maximal number of independent circuits in a graph
cites work: Regular factors in K1,n free graphs
cites work: On circuits in graphs
cites work: Q3211348
cites work: Near perfect coverings in graphs and hypergraphs
cites work: Q5620621
cites work: Vertex-Disjoint Stars in Graphs
cites work: On a packing and covering problem
cites work: Q4200109
full work available at URL: s0012-365x(99)90069-9
OpenAlex ID: W4213121896
description: scientific article; zbMATH DE number 1322015