The number of cycles in 2-factors of cubic graphs
type: Item
instance of: scholarly article
title: The number of cycles in 2-factors of cubic graphs
zbMATH Open document ID: 0728.05051
DOI: 10.1016/0012-365X(90)90133-3
author: Moshe Rosenfeld
published in: Discrete Mathematics
publication date: 1990-01-01T00:00:00Z
review text: Let \({\mathcal G}\) denote the family of all cubic 3-connected simple graphs, and let \({\mathcal G}_ p\) be the planar graphs in \({\mathcal G}\). Each graph in \({\mathcal G}\) has a 2-factor (by Petersen's Theorem). The object is to determine the number of (even) cycles needed in such 2-factors, so let \(k_ 2(G)\) \((k^ e_ 2(G))\) denote the smallest number of vertex disjoint (even) cycles that cover the vertices of G, and let \(f_ 0=\liminf | G_ n| /k_ 2(G_ p)\) for \(G_ n\in {\mathcal G}\), \(f_ 1=\liminf | G_ n| /k_ 2(G_ n)\) for \(G_ n\in {\mathcal G}_ p\), and \(f_ 2=\liminf | G_ n| /k^ e_ 2(G_ n)\) for \(G_ n\in {\mathcal G}_ p\). It is shown that \(f_ 0\leq 10\), \(f_ 1\leq 28\), and \(f_ 2\leq 31\), and also tht \(f_ 1\geq 6\).
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 4202308
zbMATH Keywords: cubic graphs
zbMATH Keywords: planar graphs
zbMATH Keywords: 2-factor
MaRDI profile type: Publication
cites work: Trees in Polyhedral Graphs
cites work: Q5422499
cites work: Pairs of edge-disjoint Hamiltonian circuits
cites work: Shortness exponents of families of graphs
cites work: Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
cites work: On Hamiltonian Circuits
cites work: A Theorem on Planar Graphs
cites work: Q4775880
description: scientific article; zbMATH DE number 4202308