On the existence of a matching orthogonal to a 2-factorization
type: Item
instance of: scholarly article
title: On the existence of a matching orthogonal to a 2-factorization
zbMATH Open document ID: 0687.05034
DOI: 10.1016/0012-365X(89)90274-4
published in: Discrete Mathematics
publication date: 1989-01-01T00:00:00Z
review text: Brian Alspach in 1988 posed the following problem: For any 2- factorization \(F_ 1,F_ 2,...,F_ d\) of a 2d-regular graph G, is it possible to find a d-matching M in G such that M contains precisely one edge from each of \(F_ 1,F_ 2,...,F_ d?\) The authors of this article show that if \(F_ 1,F_ 2,...,F_ d\) is a 2-factorization of a 2d- regular graph G of order \(n\geq 3,23d\), then G contains a d-matching with exactly one edge from each of \(F_ 1,F_ 2,...,F_ d\).
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 4125437
zbMATH Keywords: 2-factorization
zbMATH Keywords: 2d-regular graph
zbMATH Keywords: d-matching
author: Mekkia Kouider
author: D. Sotteau
reviewed by: Ortrud R. Oellermann
MaRDI profile type: Publication
cites work: Q4026144
full work available at URL: 0012-365x(89)90274-4
OpenAlex ID: W2001052814
description: scientific article; zbMATH DE number 4125437