A property of graphs of convex polytopes (Q1208046): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Hamiltonian simple polytopes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5547252 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the graph structure of convex polyhedra in \(n\)-space / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Incidence graphs of convex polytopes / rank | |||
Normal rank | |||
Latest revision as of 15:08, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A property of graphs of convex polytopes |
scientific article |
Statements
A property of graphs of convex polytopes (English)
0 references
16 May 1993
0 references
The authors prove: Let \(F\) be a \(k\)-dimensional face of a \(d\)-polytope \(P\) (\(-1 \leq k \leq d-1\)). Then the graph \(G(P)\setminus G(F)\) is \(\max(1,d-k-1)\)-connected. \((G(X)\) means the 1-skeleton of \(X\).) The bounds are best possible. [Cf. \textit{M. L. Balinski}, Pac. J. Math. 11, 431-434 (1961; Zbl 0103.396)].
0 references
