How to determine the maximum genus of a graph
From MaRDI portal
Publication:1255962
DOI10.1016/0095-8956(79)90058-3zbMath0403.05035OpenAlexW2088320806MaRDI QIDQ1255962
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)
Related Items
The maximum and minimum genus of a multibranched surface, On the orbits of the product of two permutations, On the average genus of a graph, Cyclic bi‐embeddings of Steiner triple systems on 12s + 7 points, New formulae for the decycling number of graphs, Topological Graph Theory: A Personal Account, On the complexity of graph embeddings, The maximum genus of graph bundles, Minimum genus embeddings of the complete graph, Nonseparating independent sets and maximum genus of graphs, Maximum genus and connectivity, A note on the computational complexity of graph vertex partition, Embeddings of a graph into a surface with different weak chromatic numbers, A new formula for the decycling number of regular graphs, A note on the directed genus of K_n,n,n and K_n, A tight lower bound on the maximum genus of a simplicial graph, Upper embeddability of graphs, Face distributions of embeddings of complete graphs, A note on disjoint cycles, Graph ear decompositions and graph embeddings, Maximum genus and chromatic number of graphs, The maximum genus of vertex-transitive graphs, Hierarchy for imbedding-distribution invariants of a graph, Constructions of DNA and polypeptide cages based on plane graphs and odd crossing \(\pi \)-junctions, EMBEDDING OF METRIC GRAPHS ON HYPERBOLIC SURFACES, Constructing infinite one-regular graphs, Maximum genus of strong 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}\), Characterization of the maximum genus of a signed graph, Odd components of co-trees and graph embeddings, The genus polynomials of cross-ladder digraphs in orientable surfaces, Up-embeddability of a graph by order and girth, On the number of maximum genus embeddings of almost all graphs, Results of the maximum genus of graphs, The genus distributions for a certain type of permutation graphs in orientable surfaces, A note on decycling number, vertex partition and AVD-total coloring in graphs, Maximum genus embeddings of Steiner triple systems, Unnamed Item, On the lower bounds for the maximum genus for simple graphs, Antiparallel \(d\)-stable traces and a stronger version of ore problem, A note on upper embeddable graphs, A new characterization of the maximum genus of a graph, A class of upper-embeddable graphs, Unnamed Item, Unnamed Item, Computational topology and the Unique Games Conjecture, A note on directed genera of some tournaments, 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, The genus of the balanced hypercube, Upper-embeddable graphs and related topics, The maximum genus of a 3-regular simplicial graph, New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces, Nonseparating independent sets of Cartesian product graphs, Searching for a strong double tracing in a graph, 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, Straight-ahead walks in Eulerian graphs, Edge decomposition of connected claw-free cubic graphs, Unnamed Item, 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, Maximum genus, girth and connectivity, Maximum genus and girth of graphs, Maximum genus, connectivity and minimal degree of graphs, Generating Nonisomorphic Quadrangular Embeddings of a Complete Graph, A note on the maximum genus of 3-edge-connected nonsimple 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, $N_2$-locally connected graphs and their upper embeddability, Heffter arrays and biembedding graphs on surfaces, 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, Matroids Determine the Embeddability of Graphs in Surfaces, A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs, Configurations of DNA cages based on plane graphs and vertex junctions, Overlap matrices and total imbedding distributions, The maximum genus, matchings and the cycle space of a graph, Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
Cites Work
