TY - JOUR

T1 - Existence of 3-factors in k1,n-free graphs with connectivity and edge-connectivity conditions

AU - Kotani, Keiko

AU - Nishida, Shuto

N1 - Publisher Copyright:
© The author(s).
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.

PY - 2021

Y1 - 2021

N2 - Let t be an integer satisfying t ≥ 5. We show that if G is a ⌈(t − 1)/3⌉-connected K1,t-free graph of even order with minimum degree at least ⌈(4t − 1)/3⌉, then G has a 3-factor, and if G is a ⌈(4t − 4)/3⌉-connected K1,t-free graph of even order, then G has a 3-factor. We also show that if G is a 2-edge-connected K1,4-free graph of even order with minimum degree at least 6, then G has a 3-factor.

AB - Let t be an integer satisfying t ≥ 5. We show that if G is a ⌈(t − 1)/3⌉-connected K1,t-free graph of even order with minimum degree at least ⌈(4t − 1)/3⌉, then G has a 3-factor, and if G is a ⌈(4t − 4)/3⌉-connected K1,t-free graph of even order, then G has a 3-factor. We also show that if G is a 2-edge-connected K1,4-free graph of even order with minimum degree at least 6, then G has a 3-factor.

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

M3 - Article

AN - SCOPUS:85098710731

VL - 79

SP - 106

EP - 122

JO - Australasian Journal of Combinatorics

JF - Australasian Journal of Combinatorics

SN - 1034-4942

ER -