Abstract
Given a plane graph G and two vertices s and t in G, an s-t surface separator is a closed curve C such that s belongs to the other region of R 2 \ C than t. A cycle C is called a cyclic surface separator if C is an s-t surface separator, and an odd cyclic surface separator if C is an odd cycle. We consider the problem of finding odd cyclic surface separators in planar graphs and show that the problem can be solved in polynomial time.
Original language | English (US) |
---|---|
Pages | 165-167 |
Number of pages | 3 |
State | Published - 2011 |
Event | 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011 - Frascati, Italy Duration: Jun 14 2011 → Jun 16 2011 |
Conference
Conference | 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011 |
---|---|
Country/Territory | Italy |
City | Frascati |
Period | 6/14/11 → 6/16/11 |
Keywords
- Irrelevant vertex
- Odd cycles
- Planar graphs
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics