Search CORE

1 research outputs found

Author: Neumann-Lara Víctor
Rivera-Campo Eduardo
Urrutia Jorge
Publication venue: 'Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Gora'
Publication date: 01/01/2004
Field of study

If G is a minimally 3-connected graph and C is a double cover of the set of edges of G by irreducible walks, then |E(G)| ≥ 2| C| - 2