Circuit coverings of graphs and a conjecture of Pyber
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).
scientific article; zbMATH DE number 798754