TY - JOUR
T1 - A degree condition for the existence of 1-factors in graphs or their complements
AU - Ando, Kiyoshi
AU - Kaneko, Atsushi
AU - Nishimura, Tsuyoshi
N1 - Copyright:
Copyright 2018 Elsevier B.V., All rights reserved.
PY - 1999/5/28
Y1 - 1999/5/28
N2 - We study conditions for a simple graph G or its complement Ḡ to have a 1-factor. Let G be a graph of even order n and denote by ir(G) the difference between the maximum degree and the minimum degree of G. We prove that if both G and Ḡ are connected and ir(G) ≤ [1/4n + 1], then either G or Ḡ has a 1-factor with the inequality being sharp.
AB - We study conditions for a simple graph G or its complement Ḡ to have a 1-factor. Let G be a graph of even order n and denote by ir(G) the difference between the maximum degree and the minimum degree of G. We prove that if both G and Ḡ are connected and ir(G) ≤ [1/4n + 1], then either G or Ḡ has a 1-factor with the inequality being sharp.
UR - http://www.scopus.com/inward/record.url?scp=0345884754&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0345884754&partnerID=8YFLogxK
U2 - 10.1016/S0012-365X(99)00011-4
DO - 10.1016/S0012-365X(99)00011-4
M3 - Article
AN - SCOPUS:0345884754
SN - 0012-365X
VL - 203
SP - 1
EP - 8
JO - Discrete Mathematics
JF - Discrete Mathematics
IS - 1-3
ER -