Large Independent Sets in Subquartic Planar Graphs

2016 ◽  
pp. 209-221 ◽  
Author(s):  
Matthias Mnich
Keyword(s):  
Planar Graphs ◽  
Independent Sets

The Strong Perfect Graph Conjecture for Planar Graphs

1973 ◽  
Vol 25 (1) ◽  
pp. 103-114 ◽  
Author(s):  
Alan Tucker
Keyword(s):  
Chromatic Number ◽  
Planar Graphs ◽  
Independent Set ◽  
Independent Sets ◽  
Clique Number ◽  
Perfect Graph ◽  
Stability Number ◽  
Partition Number ◽  
Minimum Number ◽  
The Stability

A graph G is called γ-perfect if ƛ (H) = γ(H) for every vertex-generated subgraph H of G. Here, ƛ(H) is the clique number of H (the size of the largest clique of H) and γ(H) is the chromatic number of H (the minimum number of independent sets of vertices that cover all vertices of H). A graph G is called α-perfect if α(H) = θ(H) for every vertex-generated subgraph H of G, where α (H) is the stability number of H (the size of the largest independent set of H) and θ(H) is the partition number of H (the minimum number of cliques that cover all vertices of H).

Bounded-Degree Independent Sets in Planar Graphs

2005 ◽  
Vol 38 (3) ◽  
pp. 253-278 ◽  
Author(s):  
Therese Biedl ◽  
Dana F. Wilkinson
Keyword(s):  
Planar Graphs ◽  
Independent Sets ◽  
Bounded Degree

scholarly journals Large Independent Sets in Triangle-Free Planar Graphs

2017 ◽  
Vol 31 (2) ◽  
pp. 1355-1373 ◽  
Author(s):  
Zdeněk Dvořák ◽  
Matthias Mnich
Keyword(s):  
Planar Graphs ◽  
Independent Sets

scholarly journals Independent sets in triangle-free cubic planar graphs

2006 ◽  
Vol 96 (2) ◽  
pp. 253-275 ◽  
Author(s):  
Christopher Carl Heckman ◽  
Robin Thomas
Keyword(s):  
Planar Graphs ◽  
Independent Sets

Acute Constraints in Straight-Line Drawings of Planar Graphs

2019 ◽  
Vol E102.A (9) ◽  
pp. 994-1001
Author(s):  
Akane SETO ◽  
Aleksandar SHURBEVSKI ◽  
Hiroshi NAGAMOCHI ◽  
Peter EADES
Keyword(s):  
Planar Graphs ◽  
Line Drawings ◽  
Straight Line

A Space-Efficient Separator Algorithm for Planar Graphs

2019 ◽  
Vol E102.A (9) ◽  
pp. 1007-1016 ◽  
Author(s):  
Ryo ASHIDA ◽  
Sebastian KUHNERT ◽  
Osamu WATANABE
Keyword(s):  
Planar Graphs
Sign in / Sign up

Export Citation Format

Share Document