Maximum genus of a graph in terms of its embedding properties.
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2210738
- On the number of maximum genus embeddings of almost all graphs
- Publication:4503680
- Maximum genus and girth of graphs
- The relative maximum genus of a graph
- scientific article; zbMATH DE number 3900781
- scientific article; zbMATH DE number 495474
- Publication:4887820
- Maximum genus, dominate number and girth of a graph
- Maximum genus of regular graphs
Cited in
(10)- Fundamental cycles and graph embeddings
- Maximum genus of strong embeddings
- scientific article; zbMATH DE number 3845605 (Why is no real title available?)
- scientific article; zbMATH DE number 4156462 (Why is no real title available?)
- Maximum genus of graphs embedded in the Klein bottle
- On locally quasiconnected graphs and their upper embeddability
- On 2-cell embeddings of graphs with minimum numbers of regions
- scientific article; zbMATH DE number 4101216 (Why is no real title available?)
- scientific article; zbMATH DE number 2210738 (Why is no real title available?)
- A note on strong embeddings of maximal planar graphs on non-orientable surfaces
This page was built for publication: Maximum genus of a graph in terms of its embedding properties.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1868846)