Factorisations of 4-regular graphs and Petersen's theorem
type: Item
instance of: scholarly article
title: Factorisations of 4-regular graphs and Petersen's theorem
zbMATH Open document ID: 0820.05053
author: Mekkia Kouider
author: G. Sabidussi
published in: Journal of Combinatorial Theory. Series B
publication date: 1995-07-02T00:00:00Z
review text: On the basis of the observation that a 3-regular graph has a perfect matching if and only if its line graph has a triangle-free 2- factorisation, we show that a connected 4-regular graph has a triangle- free 2-factorisation, provided it has no more than two cut-vertices belonging to a triangle. This result is equivalent to Petersen's theorem about the existence of perfect matchings in 3-regular graphs.
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 767689
zbMATH Keywords: perfect matching
zbMATH Keywords: line graph
zbMATH Keywords: 2-factorisation
zbMATH Keywords: Petersen's theorem
MaRDI profile type: Publication
full work available at URL: jctb.1995.1014
OpenAlex ID: W2089402305
DOI: 10.1006/JCTB.1995.1014
Recommended article: Regular graphs, regular factors, and the impact of Petersen's theorems
Recommended article: On a problem of a. kotzig concerning factorizations of 4‐regular graphs
Recommended article: P4-decompositions of regular graphs
Recommended article: Factorizations of regular graphs
Recommended article: Q4456236
Recommended article: Decomposing 4-Regular Graphs into Triangle-Free 2-Factors
Recommended article: On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs
Recommended article: Splitter theorems for 4-regular graphs
Recommended article: \(P_4\)-factorization of Cartesian product of complete graphs
Recommended article: On the \(P_4\)-components of graphs
description: scientific article; zbMATH DE number 767689