Existence of polyhedral embeddings of graphs (Q5955209)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1703967
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Existence of polyhedral embeddings of graphs |
scientific article; zbMATH DE number 1703967 |
Statements
Existence of polyhedral embeddings of graphs (English)
0 references
13 February 2002
0 references
\textit{C. Thomassen} [J. Comb. Theory, Ser. B 57, No. 2, 196--206 (1993; Zbl 0794.05025)] proved that the decision problem whether a given cubic bipartite graph contains two compatible Hamilton cycles is NP-complete. Here, the decision problem ``Does a given graph \(G\) have a polyhedral embedding'' is proven to be NP-complete by constructing, from a given 2-connected cubic bipartite graph \(G_0\) a 6-connected graph \(G_1\) which has a polyhedral embedding if and only if \(G_0\) has two compatible Hamilton cycles. Moreover, if \(G_1\) has a polyhedral embedding, it also has an orientable polyhedral embedding.
0 references
polyhedral embedding
0 references
NP-completeness
0 references
face-width
0 references
Hamilton cycles
0 references
0.8141284584999084
0 references
0.7796282172203064
0 references
0.7686205506324768
0 references
