๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs

โœ Scribed by Therese Biedl

Publisher
Springer
Year
2010
Tongue
English
Weight
618 KB
Volume
45
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Series-parallel subgraphs of planar grap
Series-parallel subgraphs of planar graphs
โœ Ehab S. Elmallah; Charles J. Colbourn ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 435 KB
Monotone drawings of planar graphs
Monotone drawings of planar graphs
โœ Jรกnos Pach; Gรฉza Tรณth ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 92 KB

## Abstract Let __G__ be a graph drawn in the plane so that its edges are represented by __x__โ€monotone curves, any pair of which cross an even number of times. We show that __G__ can be redrawn in such a way that the __x__โ€coordinates of the vertices remain unchanged and the edges become nonโ€cross

The Entire Coloring of Series-Parallel G
The Entire Coloring of Series-Parallel Graphs
โœ Jian-liang Wu; Yu-liang Wu ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Institute of Applied Mathematics, Chinese Academy ๐ŸŒ English โš– 246 KB
The complexity of the matching-cut probl
The complexity of the matching-cut problem for planar graphs and other graph classes
โœ Paul Bonsma ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 247 KB

## Abstract The Matchingโ€Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be ${\cal{NP}}$โ€complete when restricted to graphs with maximum deg