Connectivity of cubical polytopes
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,...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier
2020
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/81335 |