𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Improved Approximation of the Achromatic Number on Bipartite Graphs

✍ Scribed by Kortsarz, Guy; Shende, Sunil

Book ID
118197231
Publisher
Society for Industrial and Applied Mathematics
Year
2007
Tongue
English
Weight
190 KB
Volume
21
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

On the number of maximal bipartite subgr
On the number of maximal bipartite subgraphs of a graph
✍ Jesper Makholm Byskov; Bolette AmmitzbΓΈll Madsen; Bjarke Skjernaa πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 72 KB πŸ‘ 2 views

We show new lower and upper bounds on the maximum number of maximal induced bipartite subgraphs of graphs with n vertices. We present an infinite family of graphs having 105 n=10 % 1:5926 n ; such subgraphs show an upper bound of O(12 n=4 ) ΒΌ O(1:8613 n ) and give an algorithm that finds all maximal

A note on the number of perfect matching
A note on the number of perfect matchings of bipartite graphs
✍ Zhang Fuji; Zhang Heping πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 484 KB

Let G be a bipartite graph with 2n vertices, A its adjacency matrix and K the number of perfect matchings. For plane bipartite graphs each interior face of which is surrounded by a circuit of length 4s + 2, s E { 1,2,. . .}, an elegant formula, i.e. det A = (-1 )nK2, had been rigorously proved by Cv