A completely unambiguous 5-polyhedral graph

DOI10.1016/S0021-9800(70)80053-9zbMATH Open0199.27203MaRDI QIDQ5597449FDOQ5597449

Authors: D. W. Barnette 

Publication date: 1970

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

zbMATH Keywords

topology

Cited In (3)

• On cyclic edge-connectivity of fullerenes
• The numbers of faces of simplicial polytopes
• Polytopes, graphs, and complexes

This page was built for publication: A completely unambiguous 5-polyhedral graph

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