A new characterization of the maximum genus of a graph
From MaRDI portal
Publication:3939829
DOI10.21136/cmj.1981.101776zbMath0482.05034OpenAlexW2735095403MaRDI QIDQ3939829
Publication date: 1981
Full work available at URL: https://eudml.org/doc/13289
Related Items (45)
The maximum and minimum genus of a multibranched surface ⋮ Up-embeddability of graphs with small order ⋮ The maximum genus of graph bundles ⋮ Maximum genus and connectivity ⋮ Upper embeddability of graphs ⋮ On the graphic matroid parity problem ⋮ Maximum genus and chromatic number of graphs ⋮ The maximum genus of vertex-transitive graphs ⋮ A Survey on Covering Supermodular Functions ⋮ Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\) ⋮ Characterization of the maximum genus of a signed graph ⋮ Up-embeddability of a graph by order and girth ⋮ Matroid matching with Dilworth truncation ⋮ Up-embeddability of graphs with new degree-sum ⋮ Unnamed Item ⋮ On the lower bounds for the maximum genus for simple graphs ⋮ A note on upper embeddable graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The maximum genus of graphs of diameter two ⋮ A sufficient condition on upper embeddability of graphs ⋮ An orientation theorem with parity conditions ⋮ Multibranched surfaces in 3-manifolds ⋮ Local properties and upper embeddability of connected multigraphs ⋮ On locally quasiconnected graphs and their upper embeddability ⋮ Bidirectional retracting-free double tracings and upper embeddability of graphs ⋮ Unnamed Item ⋮ On 2-cell embeddings of graphs with minimum numbers of regions ⋮ Unnamed Item ⋮ A Nebeský-type characterization for relative maximum genus ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Exponentially many maximum genus embeddings and genus embeddings for complete graphs ⋮ Upper embeddability, girth and the degree-sum of nonadjacent vertices ⋮ Upper embeddability, edge independence number and girth ⋮ Maximum genus, girth and connectivity ⋮ The maximum genus of graphs with diameter three ⋮ Maximum genus, connectivity and minimal degree of graphs ⋮ Extensions on 2-edge connected 3-regular up-embeddable graphs ⋮ A note on the maximum genus of 3-edge-connected nonsimple graphs ⋮ Face size and the maximum genus of a graph. I: Simple graphs ⋮ $N_2$-locally connected graphs and their upper embeddability ⋮ Lower bounds on the maximum genus of loopless multigraphs ⋮ The maximum genus, matchings and the cycle space of a graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to determine the maximum genus of a graph
- Perfect matchings of a graph
- On the maximum genus of a graph
- A Kuratowski-type theorem for the maximum genus of a graph
- On the Problem of Decomposing a Graph into n Connected Factors
- A Characterization in of Upper-Embeddable Graphs
- Survey of results on the maximum genus of a graph
- The Genus, Regional Number, and Betti Number of a Graph
- Transversals and matroid partition
This page was built for publication: A new characterization of the maximum genus of a graph
