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
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
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