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

On the bipartition of graphs

โœ Scribed by Peter Buser


Book ID
104182840
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
309 KB
Volume
9
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the Nullity of Bipartite Graphs
โœ G. R. Omidi ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 95 KB
On the nullity of bipartite graphs
โœ Yi-Zheng Fan; Ke-Shi Qian ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 171 KB
On the irregularity of bipartite graphs
โœ Michael A. Henning; Dieter Rautenbach ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 160 KB
On the bipartite independence number of
โœ 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

On the chromatic uniquenes of bipartite
โœ Pablo M Salzberg; Miguel A Lรณpez; Reinaldo E Giudici ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 500 KB

We prove the chromatic uniqueness of the following infinite families of bipartite graphs: Km,,,+k, l~rt3K,,,,,,,+k, with m~>2 and 0~ 3, where K~,,, denote the graph obtained from K,,,n by deleting one edge. As a particular case we prove a conjecture made by C.Y. Chao in