Circuit coverings of graphs and a conjecture of Pyber (Q1898727)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Circuit coverings of graphs and a conjecture of Pyber |
scientific article; zbMATH DE number 798754
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Circuit coverings of graphs and a conjecture of Pyber |
scientific article; zbMATH DE number 798754 |
Statements
Circuit coverings of graphs and a conjecture of Pyber (English)
0 references
20 September 1995
0 references
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).
0 references
integer flow
0 references
bridgeless graph
0 references
circuit cover
0 references
conjecture by Pyber
0 references
