A neighbourhood condition for graphs to have \([a,b]\)-factors
type: Item
instance of: scholarly article
title: A neighbourhood condition for graphs to have \([a,b]\)-factors
zbMATH Open document ID: 0966.05062
DOI: 10.1016/S0012-365X(00)00140-0
published in: Discrete Mathematics
publication date: 2001-08-16T00:00:00Z
review text: Let \(a\) and \(b\) be integers such that \(1\leq a\leq b\). An \([a,b]\)-factor of a graph \(G\) is defined as a spanning subgraph \(F\) of \(G\) such that \(a\leq\deg_F(x)\leq b\) for all vertices \(x\). The note shows that \(G\) has an \([a,b]\)-factor if the minimum degree \(\delta(x)\geq a\), \(n\geq 2(a+b)(a+ b-1)/b\) and \(|N_G(x)\cup N_G(y)|\geq an/(a+ b)\) for any two non-adjacent vertices \(x\) and \(y\) of \(G\).
reviewed by: Wai-Kai Chen
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1533357
zbMATH Keywords: factor
zbMATH Keywords: degree
author: Haruhide Matsuda
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1533357