A completely unambiguous 5-polyhedral graph

From MaRDI portal

Revision as of 03:53, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5597449

Jump to:navigation, search

DOI10.1016/S0021-9800(70)80053-9zbMath0199.27203MaRDI QIDQ5597449

D. W. Barnette

Publication date: 1970

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

zbMATH Keywords

Related Items (3)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5597449&oldid=30239803"