Projective plan and Möbius band obstructions

DOI10.1007/BF01200908zbMath0889.05039MaRDI QIDQ1385984

Bojan Mohar

Publication date: 6 May 1998

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

graphembeddingembedding extension

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

2-restricted extensions of partial embeddings of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear algorithm for embedding planar graphs using PQ-trees
• Disjoint paths in graphs
• 2-linked graphs
• Graph minors. IX: Disjoint crossed paths
• A Kuratowski theorem for nonorientable surfaces
• Time bounded random access machines
• Graph minors. VIII: A Kuratowski theorem for general surfaces
• Obstructions For 2-Möbius Band Embedding Extension Problem
• Depth-First Search and Kuratowski Subgraphs
• Embedding Graphs in the Plane—Algorithmic Aspects
• A kuratowski theorem for the projective plane
• A Polynomial Solution to the Undirected Two Paths Problem
• Efficient Planarity Testing
• A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
• Projective Planarity in Linear Time
• Obstructions for the Disk and the Cylinder Embedding Extension Problems
• Dividing a Graph into Triconnected Components

This page was built for publication: Projective plan and Möbius band obstructions