Displaying similar documents to “A note on the circumference of graphs.”

On the Vertex Separation of Cactus Graphs

Markov, Minko (2007)

Serdica Journal of Computing

Similarity:

This paper is part of a work in progress whose goal is to construct a fast, practical algorithm for the vertex separation (VS) of cactus graphs. We prove a theorem for cacti", a necessary and sufficient condition for the VS of a cactus graph being k. Further, we investigate the ensuing ramifications that prevent the construction of an algorithm based on that theorem only.

Diameter in path graphs.

Belan, A., Jurica, P. (1999)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

A proof of the two-path conjecture.

Fleischner, Herbert, Molina, Robert R., Smith, Ken W., West, Douglas B. (2002)

The Electronic Journal of Combinatorics [electronic only]

Similarity: