dc.contributor.author Bui, Hoa dc.contributor.author Pineda-Villavicencio, Guillermo dc.contributor.author Ugon, Julien dc.date.accessioned 2020-10-04T07:56:57Z dc.date.available 2020-10-04T07:56:57Z dc.date.issued 2020 dc.identifier.citation Bui, H. and Pineda-Villavicencio, G. and Ugon, J. 2020. Connectivity of cubical polytopes. Journal of Combinatorial Theory Series A. 169: Article No. 105126. dc.identifier.uri http://hdl.handle.net/20.500.11937/81335 dc.identifier.doi 10.1016/j.jcta.2019.105126 dc.description.abstract A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. We deal with the connectivity of the graphs of cubical polytopes. We first establish that, for any d≥3, the graph of a cubical d-polytope with minimum degree δ is min⁡{δ,2d−2}-connected. Second, we show, for any d≥4, that every minimum separator of cardinality at most 2d−3 in such a graph consists of all the neighbours of some vertex and that removing the vertices of the separator from the graph leaves exactly two components, with one of them being the vertex itself. dc.language English dc.publisher Elsevier dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/4.0/ dc.subject 0102 - Applied Mathematics dc.subject 0103 - Numerical and Computational Mathematics dc.subject 0101 - Pure Mathematics dc.title Connectivity of cubical polytopes dc.type Journal Article dcterms.source.volume 169 dcterms.source.startPage 105 dcterms.source.endPage 105 dcterms.source.issn 0097-3165 dcterms.source.title Journal of Combinatorial Theory Series A dc.date.updated 2020-10-04T07:56:56Z curtin.department School of Electrical Engineering, Computing and Mathematical Sciences (EECMS) curtin.accessStatus Open access curtin.faculty Faculty of Science and Engineering curtin.contributor.orcid Bui, Hoa [0000-0002-1698-6383]
﻿