On maximum planar induced subgraphs
✍ Scribed by Luerbio Faria; Celina M. Herrera de Figueiredo; Sylvain Gravier; Candido F.X. de Mendonça; Jorge Stolfi
- Book ID
- 108112590
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 231 KB
- Volume
- 154
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract In this paper are investigated maximum bipartite subgraphs of graphs, i.e., bipartite subgraphs with a maximum number of edges. Such subgraphs are characterized and a criterion is given for a subgraph to be a unique maximum bipartite subgraph of a given graph. In particular maximum bipa
## Abstract Let ${\cal C}$ be a family of __n__ compact connected sets in the plane, whose intersection graph $G({\cal C})$ has no complete bipartite subgraph with __k__ vertices in each of its classes. Then $G({\cal C})$ has at most __n__ times a polylogarithmic number of edges, where the exponent