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 Jump Number Problem in Hereditary Classes of Bipartite Graphs
โ Scribed by Vadim V. Lozin; Michael U. Gerber
- Book ID
- 110235425
- Publisher
- Springer Netherlands
- Year
- 2000
- Tongue
- English
- Weight
- 74 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0167-8094
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A hereditary property of graphs is a class of graphs which is closed under taking induced subgraphs. For a hereditary property \(\mathscr{P}\), let \(\mathscr{P}_{n}\) denote the set of \(\mathscr{P}\) graphs on \(n\) labelled vertices. Clearly we have \(0 \leqslant\left|\mathscr{P}_{n}\right| \leqs
A class of graphs is hereditary if it is closed under taking induced subgraphs. Classes associated with graph representations have "composition sequences" and we show that this concept is equivalent to a notion of "amalgamation" which generalizes disjoint union of graphs. We also discuss how general