๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On signed digraphs with all cycles negative

โœ Scribed by Guy Chaty

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
235 KB
Volume
20
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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
On digraphs with the odd cycle property
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.

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

On the existence of a specified cycle in
On the existence of a specified cycle in digraphs with constraints on degrees
โœ Abdelhamid Benhocine ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 326 KB ๐Ÿ‘ 1 views

We prove that Woodall's and GhouileHouri's conditions on degrees which ensure that a digraph is Hamiltonian, also ensure that it contains the analog of a directed Hamiltonian cycle but with one edge pointing the wrong way; that is, it contains two vertices that are connected in the same direction by