Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Victor Neumann"'
Publikováno v:
Discussiones Mathematicae Graph Theory. 24:73
Publikováno v:
Discussiones Mathematicae Graph Theory. 24:115
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.
Autor:
Victor Neumann-Lara
Publikováno v:
Discussiones Mathematicae Graph Theory. 20:197
Publikováno v:
Discussiones Mathematicae Graph Theory. 18:85
Publikováno v:
Discussiones Mathematicae Graph Theory. 16:5