Advanced Search

Match of the following rules

Contains the following math formula (red border means the formula is incomplete)

Formula preview

Discussiones Mathematicae Graph Theory

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.

Page 1

Download Results (CSV)