A relative maximum genus graph embedding and its local maximum genus
From MaRDI portal
Publication:1594860
DOI10.1007/BF02671126zbMath0973.05024OpenAlexW1964122883MaRDI QIDQ1594860
Publication date: 28 November 2001
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02671126
Cites Work
- How to determine the maximum genus of a graph
- An obstruction to embedding graphs in surfaces
- The relative maximum genus of a graph
- Stratified graphs for imbedding systems
- On the maximum genus of a graph
- The graph genus problem is NP-complete
- Local extrema in genus-stratified graphs
- Relative Embeddings of Graphs on Closed Surfaces
- Survey of results on the maximum genus of a graph
- Unnamed Item
This page was built for publication: A relative maximum genus graph embedding and its local maximum genus