Hamiltonian circuits in simplicial complexes

DOI10.1007/BF00149287MaRDI QIDQ2264375zbMATH OpenOpenAlexWikidataFDO

Authors Günter Ewald

Publication date 1973

Published in Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00149287

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) General topology of complexes (57Q05) Triangulating manifolds (57Q15)

Cited in

(16)

• Flache Einbettungen geschlossener Mannigfaltigkeiten der Kodimension 1 in Randkomplexe konvexer Polytope
• Hamilton-Flächen auf Prismen
• Graph-theoretical conditions for inscribability and Delaunay realizability
• On mixed linear layouts of series-parallel graphs
• A survey on book-embedding of planar graphs
• Embedding planar 5-graphs in three pages
• Recognizing DAGs with page-number 2 is NP-complete
• scientific article; zbMATH DE number 90550 (Why is no real title available?)
• On Mixed Linear Layouts of Series-Parallel Graphs
• Triconnected planar graphs of maximum degree five are subhamiltonian
• Stacked polytopes and tight triangulations of manifolds
• Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
• Recognizing DAGs with page-number 2 is NP-complete
• The Rique-number of graphs
• On shortness exponents of families of graphs
• Hamiltonian submanifolds of regular polytopes

This page was built for publication: Hamiltonian circuits in simplicial complexes

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