How to determine the maximum genus of a graph
From MaRDI portal
Publication:1255962
DOI10.1016/0095-8956(79)90058-3zbMATH Open0403.05035OpenAlexW2088320806MaRDI QIDQ1255962FDOQ1255962
Authors: Nguyen Huy Xuong
Publication date: 1979
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(79)90058-3
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the maximum genus of a graph
- 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
- On cycle permutation graphs
- The Genus, Regional Number, and Betti Number of a Graph
Cited In (95)
- The maximum and minimum genus of a multibranched surface
- The maximum genus of graphs of diameter two
- Hierarchy for imbedding-distribution invariants of a graph
- A tight lower bound on the maximum genus of a 3-connected loopless multigraph
- A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs
- Up-embeddability via girth and the degree-sum of adjacent vertices
- Maximum genus of strong embeddings
- Title not available (Why is that?)
- A relative maximum genus graph embedding and its local maximum genus
- Lower bound of the number of maximum genus embeddings and genus embeddings of \(K_{12s+7}\)
- A note on disjoint cycles
- A note on upper embeddable graphs
- Graph ear decompositions and graph embeddings
- Searching for a strong double tracing in a graph
- Embeddings of a graph into a surface with different weak chromatic numbers
- On the complexity of graph embeddings
- The maximum genus of graph bundles
- Heffter arrays and biembedding graphs on surfaces
- A Nebeský-type characterization for relative maximum genus
- A sufficient condition on upper embeddability of graphs
- Maximum genus, girth and connectivity
- Overlap matrices and total imbedding distributions
- Characterization of the maximum genus of a signed graph
- Constructing infinite one-regular graphs
- Maximum genus and connectivity
- Maximum genus and chromatic number of graphs
- The maximum genus, matchings and the cycle space of a graph
- Coloring face-hypergraphs of graphs on surfaces
- Up-embeddability of a graph by order and girth
- The maximum genus of vertex-transitive graphs
- Straight-ahead walks in Eulerian graphs
- Embedding digraphs on orientable surfaces
- Maximum genus, connectivity and minimal degree of graphs
- On the orbits of the product of two permutations
- On the average genus of a graph
- Bidirectional retracting-free double tracings and upper embeddability of graphs
- Minimum genus embeddings of the complete graph
- On the lower bounds for the maximum genus for simple graphs
- Generating nonisomorphic quadrangular embeddings of a complete graph
- Upper-embeddable graphs and related topics
- Edge decomposition of connected claw-free cubic graphs
- Results of the maximum genus of graphs
- Lower bounds on the maximum genus of loopless multigraphs
- A new characterization of the maximum genus of a graph
- Upper embeddability, girth and the degree-sum of nonadjacent vertices
- Upper embeddability, edge independence number and girth
- An orientation theorem with parity conditions
- Title not available (Why is that?)
- Exponentially many maximum genus embeddings and genus embeddings for complete graphs
- Fundamental cycles and graph embeddings
- Maximum genus of regular graphs
- A note on the computational complexity of graph vertex partition
- Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
- Maximum genus and girth of graphs
- 2-cell embeddings with prescribed face lengths and genus
- $N_2$-locally connected graphs and their upper embeddability
- Face size and the maximum genus of a graph. I: Simple graphs
- On locally quasiconnected graphs and their upper embeddability
- Embedding of metric graphs on hyperbolic surfaces
- A class of upper-embeddable graphs
- Local properties and upper embeddability of connected multigraphs
- A tight lower bound on the maximum genus of a simplicial graph
- The genus distributions for a certain type of permutation graphs in orientable surfaces
- The genus polynomials of cross-ladder digraphs in orientable surfaces
- Maximum genus embeddings of Steiner triple systems
- Upper embeddability of graphs
- A note on the maximum genus of 3-edge-connected nonsimple graphs
- On the number of maximum genus embeddings of almost all graphs
- Computational topology and the unique games conjecture
- Odd components of co-trees and graph embeddings
- Matroids Determine the Embeddability of Graphs in Surfaces
- New formulae for the decycling number of graphs
- Antiparallel \(d\)-stable traces and a stronger version of ore problem
- A note on decycling number, vertex partition and AVD-total coloring in graphs
- A new formula for the decycling number of regular graphs
- Title not available (Why is that?)
- Multibranched surfaces in 3-manifolds
- Title not available (Why is that?)
- Title not available (Why is that?)
- Configurations of DNA cages based on plane graphs and vertex junctions
- Nonseparating independent sets and maximum genus of graphs
- Topological Graph Theory: A Personal Account
- A note on directed genera of some tournaments
- On 2-cell embeddings of graphs with minimum numbers of regions
- A note on the directed genus of \(K_{n,n,n}\) and \(K_n\)
- A characterization theorem for nonmaximal partial-dual planar graphs and the maximum partial-dual genus for a planar triangulated graph
- Cyclic bi‐embeddings of Steiner triple systems on 12s + 7 points
- New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces
- Title not available (Why is that?)
- The maximum genus of a 3-regular simplicial graph
- Face distributions of embeddings of complete graphs
- Nonseparating independent sets of Cartesian product graphs
- Title not available (Why is that?)
- Constructions of DNA and polypeptide cages based on plane graphs and odd crossing \(\pi \)-junctions
- The genus of the balanced hypercube
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)