How to determine the maximum genus of a graph

Cites work

A Kuratowski-type theorem for the maximum genus of a graph
Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings
scientific article; zbMATH DE number 3179262 (Why is no real title available?)
scientific article; zbMATH DE number 3518832 (Why is no real title available?)
scientific article; zbMATH DE number 3450230 (Why is no real title available?)
On cycle permutation graphs
On the maximum genus of a graph
The Genus, Regional Number, and Betti Number of a Graph

Cited in

(only showing first 100 items - show all)

Exponentially many maximum genus embeddings and genus embeddings for complete graphs
Up-embeddability via girth and the degree-sum of adjacent vertices
Upper embeddability, girth and the degree-sum of nonadjacent vertices
Fundamental cycles and graph embeddings
Upper embeddability, edge independence number and girth
The maximum genus of graph bundles
Upper embeddability of graphs
Characterization of the maximum genus of a signed graph
On the number of maximum genus embeddings of almost all graphs
Upper-embeddable graphs and related topics
Searching for a strong double tracing in a graph
A Nebeský-type characterization for relative maximum genus
Maximum genus and girth of graphs
Overlap matrices and total imbedding distributions
On the orbits of the product of two permutations
Maximum genus and chromatic number of graphs
Maximum genus of strong embeddings
Maximum genus, girth and connectivity
A note on the maximum genus of 3-edge-connected nonsimple graphs
A relative maximum genus graph embedding and its local maximum genus
Lower bounds on the maximum genus of loopless multigraphs
A tight lower bound on the maximum genus of a 3-connected loopless multigraph
New formulae for the decycling number of graphs
Odd components of co-trees and graph embeddings
A note on decycling number, vertex partition and AVD-total coloring in graphs
Maximum genus embeddings of Steiner triple systems
A note on directed genera of some tournaments
The maximum genus of a 3-regular simplicial graph
Straight-ahead walks in Eulerian graphs
Face size and the maximum genus of a graph. I: Simple graphs
Embedding digraphs on orientable surfaces
Coloring face-hypergraphs of graphs on surfaces
A tight lower bound on the maximum genus of 3-edge connected loopless graphs
Maximum genus and connectivity
A tight lower bound on the maximum genus of a simplicial graph
Constructing infinite one-regular graphs
Antiparallel \(d\)-stable traces and a stronger version of ore problem
Multibranched surfaces in 3-manifolds
Nonseparating independent sets and maximum genus of graphs
The maximum genus of graphs of diameter two
Nonseparating independent sets of Cartesian product graphs
Heffter arrays and biembedding graphs on surfaces
Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
On the average genus of a graph
A new formula for the decycling number of regular graphs
Up-embeddability of a graph by order and girth
Results of the maximum genus of graphs
The genus distributions for a certain type of permutation graphs in orientable surfaces
Maximum genus, connectivity and minimal degree of graphs
Embeddings of a graph into a surface with different weak chromatic numbers
Constructions of DNA and polypeptide cages based on plane graphs and odd crossing \(\pi \)-junctions
The genus of the balanced hypercube
Generating nonisomorphic quadrangular embeddings of a complete graph
Maximum genus of regular graphs
Minimum genus embeddings of the complete graph
A note on upper embeddable graphs
scientific article; zbMATH DE number 3933119 (Why is no real title available?)
On locally quasiconnected graphs and their upper embeddability
On 2-cell embeddings of graphs with minimum numbers of regions
Hierarchy for imbedding-distribution invariants of a graph
Matroids Determine the Embeddability of Graphs in Surfaces
A class of upper-embeddable graphs
A new characterization of the maximum genus of a graph
N₂-locally connected graphs and their upper embeddability
scientific article; zbMATH DE number 97632 (Why is no real title available?)
A note on disjoint cycles
Local properties and upper embeddability of connected multigraphs
scientific article; zbMATH DE number 495474 (Why is no real title available?)
The maximum genus, matchings and the cycle space of a graph
Cyclic bi‐embeddings of Steiner triple systems on 12s + 7 points
A note on the directed genus of \(K_{n,n,n}\) and \(K_n\)
scientific article; zbMATH DE number 846937 (Why is no real title available?)
scientific article; zbMATH DE number 907923 (Why is no real title available?)
On the complexity of graph embeddings
Computational topology and the unique games conjecture
New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces
Topological Graph Theory: A Personal Account
Embedding of metric graphs on hyperbolic surfaces
scientific article; zbMATH DE number 2230287 (Why is no real title available?)
scientific article; zbMATH DE number 2230288 (Why is no real title available?)
Configurations of DNA cages based on plane graphs and vertex junctions
An orientation theorem with parity conditions
Face distributions of embeddings of complete graphs
Graph ear decompositions and graph embeddings
2-cell embeddings with prescribed face lengths and genus
Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\)
A characterization theorem for nonmaximal partial-dual planar graphs and the maximum partial-dual genus for a planar triangulated graph
Semi-double trace and double cover: a strong stable model for multi-component polypeptide cages
The maximum partial-dual genus of a ribbon graph
Upper-embeddability and the decycling number of connected 4-regular graphs
Efficiently enumerating spanning trees of k-trees
Partial-duals for plane ribbon graphs
A theorem for the maximum genus of a digraph
Bi-eulerian embeddings of graphs and digraphs
The tree-achieving set and non-separating independent set problem of subcubic graphs
Upper embeddability of graphs and products of transpositions associated with edges
Bidirectional retracting-free double tracings and upper embeddability of graphs
Edge decomposition of connected claw-free cubic graphs
The maximum and minimum genus of a multibranched surface
A note on the computational complexity of graph vertex partition

This page was built for publication: How to determine the maximum genus of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1255962)