Graph Miners .XIV. Extending an Embedding

Neil Robertson, P. D. Seymour

Research output: Contribution to journalArticlepeer-review

13 Scopus citations


Let G be a graph, and let H be a subgraph of G drawn in a surface ∑. When can this drawing be extended to an embedding of the whole of G in ∑, up to 3-separations? We show that if such an extension is impossible, and if H is a subdivision of a simple 3-connected graph and is highly “representative”, then one of two obstructions is present. This is a lemma for use in a future paper.

Original languageEnglish (US)
Pages (from-to)23-50
Number of pages28
JournalJournal of Combinatorial Theory, Series B
Issue number1
StatePublished - Sep 1995
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Graph Miners .XIV. Extending an Embedding'. Together they form a unique fingerprint.

Cite this