Polyhedral embeddings in the projective plane

Autor:	David Barnette
Rok vydání:	1991
Předmět:	General Mathematics Computer Science::Computational Geometry Planar graph Combinatorics symbols.namesake Computer Science::Graphics Steinitz's theorem Real projective plane TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY symbols Mathematics::Metric Geometry Embedding Topological graph theory ComputerSystemsOrganization_SPECIAL-PURPOSEANDAPPLICATION-BASEDSYSTEMS Projective plane Connectivity ComputingMethodologies_COMPUTERGRAPHICS MathematicsofComputing_DISCRETEMATHEMATICS Mathematics Polyhedral graph
Zdroj:	Israel Journal of Mathematics. 73:91-95
ISSN:	1565-8511 0021-2172
DOI:	10.1007/bf02773427
Popis:	We characterize the graphs that have polyhedral embeddings in the projective plane. We also prove that if one embedding of a graph is polyhedral then all embeddings of that graph are polyhedral.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::9b3b842a7a263271e11df48644260909 https://doi.org/10.1007/bf02773427 Zobrazit plný text záznamu Full text from SpringerLink