A classification of polyhedral graph by combinatorially rigid vertices

MaRDI QIDQ6278849zbMATH OpenFDO

Authors Seonhwa Kim, Yunhi Cho

Publication date 18 October 2016

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Three-dimensional polytopes (52B10) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Abstract: When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (emph{combinatorially}) emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a classification of polyhedra.

This page was built for publication: A classification of polyhedral graph by combinatorially rigid vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6278849)