Title of article
Planarization and fragmentability of some classes of graphs Original Research Article
Author/Authors
Keith Edwards، نويسنده , , Graham Farr، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
11
From page
2396
To page
2406
Abstract
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that need to be removed from the graphs in the class in order to leave behind bounded sized components. We have previously given bounds on this parameter for the class of graphs satisfying a given constant bound on maximum degree. In this paper, we give fragmentability
Keywords
Planarity , Planarization , Fragmentability , Induced planar subgraph , Induced series-parallel subgraph , Algorithm
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
947333
Link To Document