Skip to main content
SpringerLink
Log in

Existence of Polyhedral Embeddings of Graphs

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

It is proved that the decision problem about the existence of an embedding of face-width 3 of a given graph is NP-complete. A similar result is proved for some related decision problems. This solves a problem raised by Neil Robertson.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Ljubljana; 1111 Ljubljana, Slovenia; E-mail: bojan.mohar@uni-lj.si, , , , , , SI

    Bojan Mohar

Authors
  1. Bojan Mohar
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received July 6, 1998

RID="*"

ID="*" Supported in part by the Ministry of Science and Technology of Slovenia, Research Project J1–0502–0101–98.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mohar, B. Existence of Polyhedral Embeddings of Graphs. Combinatorica 21, 395–401 (2001). https://doi.org/10.1007/s004930100003

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930100003

Search

Navigation