A characterization of a graph which has a 2-factor

DOI10.1016/S0893-9659(00)00069-0MaRDI QIDQ1586304zbMATH OpenOpenAlexFDO

Authors Yumiko Abe

Publication date 13 November 2000

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0893-9659(00)00069-0

zbMATH Keywords

2-factor of graphscharacterization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph theory (including graph drawing) in computer science (68R10)

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\).

Recommendations

• scientific article; zbMATH DE number 1743771
• scientific article; zbMATH DE number 1933054
• A degree condition of 2-factors in bipartite graphs
• A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs
• Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles

Cited in

(3)

• Graphs containing every 2-factor
• scientific article; zbMATH DE number 5717198 (Why is no real title available?)
• A characterization of graphs without even factors

This page was built for publication: A characterization of a graph which has a 2-factor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1586304)