A characterization of a graph which has a 2-factor
type: Item
instance of: scholarly article
title: A characterization of a graph which has a 2-factor
zbMATH Open document ID: 0966.05065
DOI: 10.1016/S0893-9659(00)00069-0
author: Yumiko Abe
published in: Applied Mathematics Letters
publication date: 2000-11-13T00:00:00Z
review text: For a graph \(G\) let FBUB\((G)\) be the sum of the number of vertices of odd degree and twice the number of isolated vertices in \(G\). Set \( \text{BUB}(G) = \min\{ \text{FBUB}(G') : G' \text{ spanning subgraph of } G\}\). The author proves that a graph \(G\) has a 2-factor if and only if BUB\((G-S) \leq 2|S|\) for every proper subset \(S\) of the vertex set of \(G\).
reviewed by: Van Bang Le
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1528566
zbMATH Keywords: 2-factor of graphs
zbMATH Keywords: characterization
MaRDI profile type: Publication
full work available at URL: s0893-9659(00)00069-0
OpenAlex ID: W1963842058
description: scientific article; zbMATH DE number 1528566