✦ LIBER ✦

On strongly connected digraphs with bounded cycle length

✍ Scribed by Samir Khuller; Balaji Raghavachari; Neal Young

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 590 KB
Volume: 69
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(95)00105-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On complete strongly connected digraphs

On complete strongly connected digraphs with the least number of 3-cycles

✍ M. Burzio; J. Pelant 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 186 KB

The least number of 3-cycles (cycles of length 3) that a hamiltonian tournament of order n can contain is n -2 (see [3]). Since each complete strongly connected digraph contains a spanning hamiltonian subtournament (see [2]), n-2 is also the least number of 3-cycles for these digraphs. In this pape

Bounds of the longest directed cycle len

Bounds of the longest directed cycle length for minimal strong digraphs

✍ Zhi-bo Chen; Fu-ji Zhang 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 532 KB

In this paper we present the upper and lower bounds of the longest directed cycle length for minimal strr,ng digraphs in terms of the numbers of vertices and arcs. These bounds are both sharp. In addition, we give analogous results for minimal 2-edge connected graphs.

A note on top down and bottom up analysi

A note on top down and bottom up analysis of strongly connected digraphs

✍ G. Chaty; M. Chein 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 124 KB

Knuth proposed to compare his method and those of Luce for studying strongly connected digraphs. Changing Knuth's notation slightly we construct a set of strongly connected digraphs which is equal to the set of the compound circuits defined by Luce. (Let us recall that Luce proved that a minimal str

On digraphs with the odd cycle property

✍ Rachel Manber; Jia-Yu Shao 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 462 KB

We say that a digraph D has the odd cycle property if there exists an edge subset S such that every cycle of D has an odd number of edges from S. We give necessary and sufficient conditions for a digraph to have the odd cycle property. We also consider the analogous problem for graphs.

Berge graphs with chordless cycles of bo

Berge graphs with chordless cycles of bounded length

✍ Rusu, Irena 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB 👁 2 views

A graph is called weakly triangulated if it contains no chordless cycle on five or more vertices (also called hole) and no complement of such a cycle (also called antihole). Equivalently, we can define weakly triangulated graphs as antihole-free graphs whose induced cycles are isomorphic either to C

On signed digraphs with all cycles negat

On signed digraphs with all cycles negative

✍ Frank Harary; J. Richard Lundgren; John S. Maybee 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 410 KB