An identity involving 3-regular graphs
type: Item
instance of: scholarly article
title: An identity involving 3-regular graphs
zbMATH Open document ID: 0857.05076
DOI: 10.1016/0012-365X(94)00274-M
author: Douglas R. Woodall
published in: Discrete Mathematics
publication date: 1996-07-07T00:00:00Z
review text: The author shows that if \(M\) is a perfect matching in a 3-regular graph \(G\), then the number of positive-minus-negative \(M\)-covers of \(G\) is equal to the number of positive-minus-negative \(M\)-partitions of \(G\). Also, either there are no \(M\)-partitions of \(G\), or every \(M\)-partition and every \(M\)-cover has the same sign.
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 897584
zbMATH Keywords: 3-regular graphs
zbMATH Keywords: perfect matching
zbMATH Keywords: \(M\)-partitions
zbMATH Keywords: \(M\)-cover
reviewed by: B. Leo Raktoe
MaRDI profile type: Publication
cites work: A short algorithm to delete singular junctions in bond graphs
cites work: Bond graphs. II: Causality and singularity
description: scientific article; zbMATH DE number 897584