We study the class of directed graphs that have indegree = outdegree = 2 a t every vertex. These digraphs can be decomposed uniquely into "alternating cycles"; w e use this decomposition to present efficient techniques for counting and generating them. The number (up to isomorphism) of these digraph
The line digraph of a regular and pancircular digraph is also regular and pancircular
β Scribed by Masatosi Imori; Makoto Matsumoto; Hisao Yamada
- Publisher
- Springer Japan
- Year
- 1988
- Tongue
- English
- Weight
- 249 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A digraph D with n vertices is said to be decomposable into a set S of dicycles if every arc of D is contained in exactly one member of S. Counterexamples are given to the following conjectures which are generalizations of three well-known conjectures by G. Hajos, P. Erdos, and P. J. Kelly: (1) [B.
There has long been an assumption that normal disjunction of the sex chromosomes of all mammals is assured by synapsis of a region of homology between the X and Y and that an 'obligatory' crossover with chiasmata formation follows. Evidence is presented here that much (if not all) observed synapsis
## Abstract In this paper we present a new theoretical model for the modelling of the microstrip line as well as two types of discontinuities: regular (open end, step, bend and Tβ and crossβjunctions) and irregular (stub and bentβstub). The twoβdimensional exact dyadic Green function of a grounded
## Abstract We prove the theorem from the title: the acyclic edge chromatic number of a random __d__βregular graph is asymptotically almost surely equal to __d__β+β1. This improves a result of Alon, Sudakov, and Zaks and presents further support for a conjecture that Ξ(G)β+β2 is the bound for the a