Abstract
An independent set in a graph is a set of vertices without edges between them. Every planar graph has an independent set of size at least 14n, and there are planar graphs for which no larger independent sets are possible. In this paper, similar bounds are provided for the problem of bounded-degree independent set, i.e. an independent set where additionally all vertices have degree less than a pre-specified bound D. Our upper and lower bounds match (up to a small constant) for D ≤ 16. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Biedl, T., & Wilkinson, D. F. (2002). Bounded-degree independent sets in planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2518 LNCS, pp. 416–427). https://doi.org/10.1007/3-540-36136-7_37
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
