Displaying similar documents to “Connected simple graphs and a selection problem”

A note on minimally 3-connected graphs

Víctor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia (2004)

Discussiones Mathematicae Graph Theory

Similarity:

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.

The interval function of a connected graph and a characterization of geodetic graphs

Ladislav Nebeský (2001)

Mathematica Bohemica

Similarity:

The interval function (in the sense of H. M. Mulder) is an important tool for studying those properties of a connected graph that depend on the distance between vertices. An axiomatic characterization of the interval function of a connected graph was published by Nebeský in 1994. In Section 2 of the present paper, a simpler and shorter proof of that characterization will be given. In Section 3, a characterization of geodetic graphs will be established; this characterization will utilize...