The Library
Vertex decompositions of two-dimensional complexes and graphs
Tools
Tools
Tools
Adamaszek, Michał (2012) Vertex decompositions of two-dimensional complexes and graphs. Contributions to Discrete Mathematics, Volume 7 (Number 2). pp. 84-96.
Research output not available from this repository, contact author.
Official URL: http://hdl.handle.net/10515/sy59w09f0
Abstract
We investigate families of two-dimensional simplicial complexes defined in terms of vertex decompositions. They include nonevasive complexes, strongly collapsible complexes of Barmak and Miniam and analogues of 2-trees of Harary and Palmer. We investigate the complexity of recognition problems for those families and some of their combinatorial properties. Certain results follow from analogous decomposition techniques for graphs. For example, we prove that it is NP-complete to decide if a graph can be reduced to a discrete graph by a sequence of removals of vertices of degree 3.
| Item Type: | Journal Article |
|---|---|
| Alternative Title: | |
| Divisions: | Faculty of Science > Mathematics |
| Journal or Publication Title: | Contributions to Discrete Mathematics |
| Publisher: | University of Calgary * Department of Mathematics and Statistics |
| ISSN: | 1715-0868 |
| Official Date: | 2012 |
| Volume: | Volume 7 |
| Number: | Number 2 |
| Page Range: | pp. 84-96 |
| Status: | Peer Reviewed |
| Publication Status: | Published |
| Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
