Characterizing minimally 1-factorable \(r\)-regular bipartite graphs
type: Item
instance of: scholarly article
title: Characterizing minimally 1-factorable \(r\)-regular bipartite graphs
zbMATH Open document ID: 0994.05123
DOI: 10.1016/S0012-365X(01)00189-3
published in: Discrete Mathematics
publication date: 2002-05-28T00:00:00Z
review text: The author considers the problem of classifying \(r\)-regular bigraphs which are minimally 1-factorable. A graph is called minimally 1-factorable, if it has a 1-factorisation and every 1-factor lies in a unique 1-factorisation. Minimally 1-factorable cubic graphs of girth 4 are classified.
reviewed by: Katherine Heinrich
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1746254
zbMATH Keywords: biprtite graph
zbMATH Keywords: 1-factor
zbMATH Keywords: cubic graph
zbMATH Keywords: 1-factorization
author: D. Labbate
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1746254