Shortest coverings of graphs with cycles
Résumé
It is shown that the edges of a bridgeless graph G can be covered with cycles such that the sum of the lengths of the cycle is at most |E(G) + min {23|E(G)|, 73(|V(G)| − 1)}.
Origine : Fichiers produits par l'(les) auteur(s)