A note on the circumference of graphs.

Stacho, L.

Loading [MathJax]/extensions/MathZoom.js

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

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

Degree powers in graphs with a forbidden even cycle.

Nikiforov, Vladimir (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Long path lemma concerning connectivity and independence number.

Fujita, Shinya, Halperin, Alexander, Magnant, Colton (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On extremal graphs with no long paths.

Ali, Asad Ali, Staton, William (1996)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Constructive upper bounds for cycle-saturated graphs of minimum size.

Gould, Ronald, Łuczak, Tomasz, Schmitt, John (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

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.