Sewing ribbons on graphs in space

DOI10.1006/jctb.2002.2076zbMath1028.05027OpenAlexW2052233329MaRDI QIDQ1850620

C. Paul Bonnington, R. Bruce Richter, Jozef Širáň, Dan S. Archdeacon

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a48954642898c2a2c3cf0d806351ac776ed37e71

zbMATH Keywords

characterizationplanaritypolynomial-time algorithmlabeled graphribbon complex

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Triangulating manifolds (57Q15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

A characterization of projective-planar signed graphs

Cites Work

• Sachs' linkless embedding conjecture
• Efficient Planarity Testing
• Characterizing planarity using theta graphs
• Dividing a Graph into Triconnected Components
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sewing ribbons on graphs in space