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

On the Numbers of Some Subtournaments of a Bipartite Tournament

โœ Scribed by KUNWARJIT S. BAGGA; LOWELL W. BEINEKE

Book ID
119862992
Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
318 KB
Volume
555
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The number of bipartite tournaments with
The number of bipartite tournaments with a unique given factor
โœ Manoussakis Manolis; Manoussakis Yannis ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 571 KB

We give a recursive function in order to calculate the number of all nonisomorphic bipartite tournaments containing an unique hamiltonian cycle. Using this result we determine the number of all nonisomorphic bipartite tournaments that admit an unique factor isomorphic to a given l-diregular bipartit

On the bipartite independence number of
On the bipartite independence number of a balanced bipartite graph
โœ Odile Favaron; Pedro Mago; Oscar Ordaz ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 603 KB

Venezuela Ap. 47567, Caracas Favaron, O., P. Mago and 0. Ordaz, On the bipartite independence number of a balanced bipartite graph, Discrete Mathematics 121 (1993) 55-63. The bipartite independence number GI aIp of a bipartite graph G is the maximum order of a balanced independent set of G. Let 6 b