Circuit coverings of graphs and a conjecture of Pyber
type: Item
instance of: scholarly article
title: Circuit coverings of graphs and a conjecture of Pyber
zbMATH Open document ID: 0831.05052
published in: Journal of Combinatorial Theory. Series B
publication date: 1995-09-20T00:00:00Z
review text: It is proved that every bridgeless graph \(G\) has a circuit cover \({\mathcal F}\) such that each vertex \(v\) is contained in at most \(\max \{d(v), 3\}\) members of \({\mathcal F}\). This result proves a conjecture by Pyber (1992).
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 798754
zbMATH Keywords: integer flow
zbMATH Keywords: bridgeless graph
zbMATH Keywords: circuit cover
zbMATH Keywords: conjecture by Pyber
author: Genghua Fan
MaRDI profile type: Publication
full work available at URL: jctb.1995.1040
OpenAlex ID: W2087082869
DOI: 10.1006/JCTB.1995.1040
description: scientific article; zbMATH DE number 798754