Large Independent Sets in Triangle-Free Planar Graphs

DOI10.1007/978-3-662-44777-2_29zbMath1371.68110arXiv1311.2749OpenAlexW2737954327MaRDI QIDQ2921419

Zdeněk Dvořák, Matthias Mnich

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.2749

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Triangle-free planar graphs with small independence number ⋮ $(3a:a)$-List-Colorability of Embedded Graphs of Girth at Least Five ⋮ Large Independent Sets in Subquartic Planar Graphs ⋮ Large Independent Sets in Triangle-Free Planar Graphs

This page was built for publication: Large Independent Sets in Triangle-Free Planar Graphs