Hierarchy for imbedding-distribution invariants of a graph

From MaRDI portal
Publication:3784089

DOI10.1002/jgt.3190110211zbMath0643.05026OpenAlexW2030792796MaRDI QIDQ3784089

Merrick L. Furst, Jonathan L. Gross

Publication date: 1987

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190110211




Related Items (55)

On the average genus of a graphA note on approximating graph genusEnumeration of graph embeddingsBounds for the average genus of the vertex-amalgamation of graphsOn the complexity of graph embeddingsA unified approach to polynomial sequences with only real zerosStratified graphs for imbedding systemsLog-concavity of genus distributions for circular laddersRegular graph coverings whose covering transformation groups have the isomorphism extension propertyMaximum genus and connectivityGenus distributions for two classes of graphsPermutation-partition pairs. III: Embedding distributions of linear families of graphsA note on the directed genus of K_n,n,n and K_nPartial-dual Euler-genus distributions for bouquets with small Euler genusA tight lower bound on the maximum genus of a simplicial graphDistributions of regular branched prime-fold coverings of surfacesEmbedding distributions and Chebyshev polynomialsEnumerating graph embeddings and partial-duals by genus and Euler genusAlgorithmic graph embeddingsFace distributions of embeddings of complete graphsLog-concavity of genus distributions of ring-like families of graphsGenus distributions for iterated clawsTotal embedding distributions of Ringel laddersAn Introduction to Random Topological Graph TheoryGenus polynomials of ladder-like sequences of graphsGenus distribution of \(P_3 \mathop\square P_n\)Enumeration of digraph embeddingsUnnamed ItemGenus distributions of star-laddersLimit points for average genus. I: 3-connected and 2-connected simplicial graphsRemarks on the lower bounds for the average genusCalculating genus polynomials via string operations and matricesCounting orientable embeddings by genus for a type of 3-regular graphThe genus polynomials of cross-ladder digraphs in orientable surfacesOrientable embedding genus distribution for certain types of graphsRoot geometry of polynomial sequences. I: Type \((0, 1)\)Partial duality for ribbon graphs. I: distributionsGenus distributions for several types of ladder-class graphsOn the number of maximum genus embeddings of almost all graphsAlgorithmic graph embeddingsLimit points for average genus. II: 2-connected non-simplicial graphsEmbedding of circulant graphs and generalized Petersen graphs on projective planeThe semi-arc automorphism group of a graph with application to map enumerationA note on directed genera of some tournamentsNumber of embeddings of circular and Möbius ladders on surfacesThe total embedding distributions of cacti and necklacesPartial duality for ribbon graphs. II: Partial-twuality polynomials and monodromy computationsGenera of Cayley mapsGenus distributions for bouquets of circlesThe average genus for bouquets of circles and dipolesGenus distribution of ladder type and cross type graphsTotal Embedding Distributions of Circular LaddersLog-Concavity of the Genus Polynomials of Ringel LaddersRandom Cayley maps for groups generated by involutionsOverlap matrices and total imbedding distributions



Cites Work




This page was built for publication: Hierarchy for imbedding-distribution invariants of a graph