K1, 3-factors in graphs

Yoshimi Egawa; Shinya Fujita; Katsuhiro Ota

doi:10.1016/j.disc.2007.11.013

K_{1, 3}-factors in graphs

Yoshimi Egawa, Shinya Fujita, Katsuhiro Ota

Department of Mathematics

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

3 Citations (Scopus)

Abstract

Let k be a positive integer. It is shown that if G is a graph of order 4 k with minimum degree at least 2 k, then G contains k vertex-disjoint copies of K_{1, 3}, unless G is isomorphic to K_{2 k, 2 k} with k being odd.

Original language	English
Pages (from-to)	5965-5973
Number of pages	9
Journal	Discrete Mathematics
Volume	308
Issue number	24
DOIs	https://doi.org/10.1016/j.disc.2007.11.013
Publication status	Published - 2008 Dec 28

Keywords

Claw
Factor
Minimum degree
Vertex-disjoint subgraphs

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2007.11.013

Cite this

@article{537123b99771415c90ccfa002d51c556,

title = "K1, 3-factors in graphs",

abstract = "Let k be a positive integer. It is shown that if G is a graph of order 4 k with minimum degree at least 2 k, then G contains k vertex-disjoint copies of K1, 3, unless G is isomorphic to K2 k, 2 k with k being odd.",

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

author = "Yoshimi Egawa and Shinya Fujita and Katsuhiro Ota",

year = "2008",

month = dec,

day = "28",

doi = "10.1016/j.disc.2007.11.013",

language = "English",

volume = "308",

pages = "5965--5973",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "24",

}

TY - JOUR

T1 - K1, 3-factors in graphs

AU - Egawa, Yoshimi

AU - Fujita, Shinya

AU - Ota, Katsuhiro

PY - 2008/12/28

Y1 - 2008/12/28

N2 - Let k be a positive integer. It is shown that if G is a graph of order 4 k with minimum degree at least 2 k, then G contains k vertex-disjoint copies of K1, 3, unless G is isomorphic to K2 k, 2 k with k being odd.

AB - Let k be a positive integer. It is shown that if G is a graph of order 4 k with minimum degree at least 2 k, then G contains k vertex-disjoint copies of K1, 3, unless G is isomorphic to K2 k, 2 k with k being odd.

KW - Claw

KW - Factor

KW - Minimum degree

KW - Vertex-disjoint subgraphs

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

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

U2 - 10.1016/j.disc.2007.11.013

DO - 10.1016/j.disc.2007.11.013

M3 - Article

AN - SCOPUS:56649114546

SN - 0012-365X

VL - 308

SP - 5965

EP - 5973

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 24

ER -