A characterization of a graph which has a 2-factor (Q1586304)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1528566
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of a graph which has a 2-factor |
scientific article; zbMATH DE number 1528566 |
Statements
A characterization of a graph which has a 2-factor (English)
0 references
13 November 2000
0 references
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\).
0 references
2-factor of graphs
0 references
characterization
0 references
0.7722049355506897
0 references
0.7717148065567017
0 references
