Vertex-disjoint claws in graphs

Yoshimi Egawa; Katsuhiro Ota

doi:10.1016/s0012-365x(99)90069-9

Vertex-disjoint claws in graphs

Yoshimi Egawa, Katsuhiro Ota

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

7 Citations (Scopus)

Abstract

Let δ(G) denote the minimum degree of a graph G. We prove that a graph G of order at least 4k + 6 with δ(G) ≥ 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.

Original language	English
Pages (from-to)	225-246
Number of pages	22
Journal	Discrete Mathematics
Volume	197-198
DOIs	https://doi.org/10.1016/s0012-365x(99)90069-9
Publication status	Published - 1999 Feb 28

Keywords

Claw
Minimum degree
Vertex-disjoint subgraphs

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/s0012-365x(99)90069-9

Fingerprint Dive into the research topics of 'Vertex-disjoint claws in graphs'. Together they form a unique fingerprint.

Cite this

@article{6bfc6cdeaea74a448486360bb33092b3,

title = "Vertex-disjoint claws in graphs",

abstract = "Let δ(G) denote the minimum degree of a graph G. We prove that a graph G of order at least 4k + 6 with δ(G) ≥ k + 2 contains k pairwise vertex-disjoint K1,3's. The conditions on the minimum degree and on the order of the graph are best possible in a sense.",

keywords = "Claw, Minimum degree, Vertex-disjoint subgraphs",

author = "Yoshimi Egawa and Katsuhiro Ota",

year = "1999",

month = feb,

day = "28",

doi = "10.1016/s0012-365x(99)90069-9",

language = "English",

volume = "197-198",

pages = "225--246",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

}

TY - JOUR

T1 - Vertex-disjoint claws in graphs

AU - Egawa, Yoshimi

AU - Ota, Katsuhiro

PY - 1999/2/28

Y1 - 1999/2/28

N2 - Let δ(G) denote the minimum degree of a graph G. We prove that a graph G of order at least 4k + 6 with δ(G) ≥ k + 2 contains k pairwise vertex-disjoint K1,3's. The conditions on the minimum degree and on the order of the graph are best possible in a sense.

AB - Let δ(G) denote the minimum degree of a graph G. We prove that a graph G of order at least 4k + 6 with δ(G) ≥ k + 2 contains k pairwise vertex-disjoint K1,3's. The conditions on the minimum degree and on the order of the graph are best possible in a sense.

KW - Claw

KW - Minimum degree

KW - Vertex-disjoint subgraphs

UR - http://www.scopus.com/inward/record.url?scp=0142115224&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0142115224&partnerID=8YFLogxK

U2 - 10.1016/s0012-365x(99)90069-9

DO - 10.1016/s0012-365x(99)90069-9

M3 - Article

AN - SCOPUS:0142115224

VL - 197-198

SP - 225

EP - 246

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

ER -