A large set of torus obstructions and how they were discovered
From MaRDI portal
Publication:1700776
zbMath1380.05134MaRDI QIDQ1700776
Jennifer Woodcock, Wendy J. Myrvold
Publication date: 22 February 2018
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p16
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
Non-separating planar graphs ⋮ Characterization of groups with planar, toroidal or projective planar (proper) reduced power graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Errors in graph embedding algorithms
- The obstructions for toroidal graphs with no \(K_{3,3}\)'s
- An approach to the subgraph homeomorphism problem
- 103 graphs that are irreducible for the projective plane
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- A Kuratowski theorem for nonorientable surfaces
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- Obstructions of Connectivity Two for Embedding Graphs into the Torus
- Algorithm Engineering: Concepts and Practice
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
- Depth-First Search and Kuratowski Subgraphs
- Solution to König's Graph Embedding Problem
- Embedding Graphs in the Plane—Algorithmic Aspects
- A kuratowski theorem for the projective plane
- A Depth-First-Search Characterization of Planarity
- Efficient Planarity Testing
- Embedding graphs in the torus in linear time
- Additivity of the genus of a graph
This page was built for publication: A large set of torus obstructions and how they were discovered
