A new characterization of the maximum genus of a graph
From MaRDI portal
Cites work
- A Characterization in of Upper-Embeddable Graphs
- A Kuratowski-type theorem for the maximum genus of a graph
- How to determine the maximum genus of a graph
- scientific article; zbMATH DE number 3179262 (Why is no real title available?)
- scientific article; zbMATH DE number 3588683 (Why is no real title available?)
- scientific article; zbMATH DE number 3625415 (Why is no real title available?)
- scientific article; zbMATH DE number 3450230 (Why is no real title available?)
- scientific article; zbMATH DE number 3312524 (Why is no real title available?)
- scientific article; zbMATH DE number 3394154 (Why is no real title available?)
- On the maximum genus of a graph
- On the Problem of Decomposing a Graph into n Connected Factors
- Perfect matchings of a graph
- Survey of results on the maximum genus of a graph
- The Genus, Regional Number, and Betti Number of a Graph
- Transversals and matroid partition
Cited in
(47)- 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
- The maximum genus of graph bundles
- Upper embeddability of graphs
- Characterization of the maximum genus of a signed graph
- A Nebeský-type characterization for relative maximum genus
- The maximum genus of graphs with diameter three
- Extensions on 2-edge connected 3-regular up-embeddable graphs
- On the graphic matroid parity problem
- Maximum genus and chromatic number of graphs
- Maximum genus, girth and connectivity
- A note on the maximum genus of 3-edge-connected nonsimple graphs
- Lower bounds on the maximum genus of loopless multigraphs
- Face size and the maximum genus of a graph. I: Simple graphs
- Maximum genus and connectivity
- Multibranched surfaces in 3-manifolds
- The maximum genus of graphs of diameter two
- Up-embeddability of a graph by order and girth
- Matroid matching with Dilworth truncation
- Maximum genus, connectivity and minimal degree of graphs
- Maximum genus of regular graphs
- A Survey on Covering Supermodular Functions
- 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
- N₂-locally connected graphs and their upper embeddability
- scientific article; zbMATH DE number 97632 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 846937 (Why is no real title available?)
- scientific article; zbMATH DE number 907923 (Why is no real title available?)
- Up-embeddability of graphs with new degree-sum
- scientific article; zbMATH DE number 2230287 (Why is no real title available?)
- scientific article; zbMATH DE number 2230288 (Why is no real title available?)
- An orientation theorem with parity conditions
- 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
- Bi-eulerian embeddings of graphs and digraphs
- Bidirectional retracting-free double tracings and upper embeddability of graphs
- The maximum and minimum genus of a multibranched surface
- Up-embeddability of graphs with small order
- The maximum genus of vertex-transitive graphs
- On the lower bounds for the maximum genus for simple graphs
- A sufficient condition on upper embeddability of graphs
This page was built for publication: A new characterization of 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 Q3939829)
