The Library
Boundary classes of planar graphs
Tools
Tools
Tools
Lozin, Vadim V.. (2008) Boundary classes of planar graphs. Combinatorics, Probability & Computing, Vol.17 (No.2). pp. 287-295. ISSN 0963-5483
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1017/S0963548307008814
Abstract
We analyse classes of planar graphs with respect to various properties such as polynomial-time solvability of the DOMINATING SET problem or boundedness of the tree-width. A helpful tool to address this question is the notion of boundary classes. The main result of the paper is that for many important properties there are exactly two boundary classes of planar graphs.
| Item Type: | Journal Article |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software Q Science > QA Mathematics |
| Divisions: | Faculty of Science > Mathematics |
| Journal or Publication Title: | Combinatorics, Probability & Computing |
| Publisher: | Cambridge University Press |
| ISSN: | 0963-5483 |
| Date: | March 2008 |
| Volume: | Vol.17 |
| Number: | No.2 |
| Number of Pages: | 9 |
| Page Range: | pp. 287-295 |
| Identification Number: | 10.1017/S0963548307008814 |
| Status: | Peer Reviewed |
| Publication Status: | Published |
| Access rights to Published version: | Restricted or Subscription Access |
| URI: | http://wrap.warwick.ac.uk/id/eprint/30333 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
