Hierarchy for imbedding-distribution invariants of a graph
From MaRDI portal
Publication:3784089
Recommendations
Cites work
Cited in
(58)- Genus distributions for several types of ladder-class graphs
- Genus polynomials of ladder-like sequences of graphs
- An Introduction to Random Topological Graph Theory
- Genus distributions for iterated claws
- Total embedding distributions of Ringel ladders
- Stratified graphs for imbedding systems
- Genus distribution of \(P_3 \mathop\square P_n\)
- The genus distribution of cubic graphs and asymptotic number of rooted cubic maps with high genus
- Embeddings of circular ladder-like graph families
- Root geometry of polynomial sequences. I: Type \((0, 1)\)
- Log-concavity of genus distributions of ring-like families of graphs
- Total embedding distributions of circular ladders
- Distributions of regular branched prime-fold coverings of surfaces
- Partial duality for ribbon graphs. I: distributions
- Genus distributions for two classes of graphs
- Permutation-partition pairs. III: Embedding distributions of linear families of graphs
- On the complexity of graph embeddings
- Partial duality for ribbon graphs. II: Partial-twuality polynomials and monodromy computations
- A note on approximating graph genus
- Overlap matrices and total imbedding distributions
- Log-concavity of genus distributions for circular ladders
- Genus distributions for bouquets of circles
- Number of embeddings of circular and Möbius ladders on surfaces
- Maximum genus and connectivity
- Distribution of embeddings
- Embedding distributions and Chebyshev polynomials
- Log-concavity of the genus polynomials of Ringel ladders
- Random Cayley maps for groups generated by involutions
- Genus distributions of star-ladders
- Genera of Cayley maps
- Algorithmic graph embeddings
- Genus distribution of ladder type and cross type graphs
- A note on directed genera of some tournaments
- Embedding of circulant graphs and generalized Petersen graphs on projective plane
- Algorithmic graph embeddings
- A note on the directed genus of \(K_{n,n,n}\) and \(K_n\)
- On the average genus of a graph
- Orientable embedding genus distribution for certain types of graphs
- The semi-arc automorphism group of a graph with application to map enumeration
- The total embedding distributions of cacti and necklaces
- Remarks on the lower bounds for the average genus
- A unified approach to polynomial sequences with only real zeros
- The average genus for bouquets of circles and dipoles
- Enumeration of digraph embeddings
- Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
- Enumeration of graph embeddings
- Bounds for the average genus of the vertex-amalgamation of graphs
- Limit points for average genus. II: 2-connected non-simplicial graphs
- Enumerating graph embeddings and partial-duals by genus and Euler genus
- Face distributions of embeddings of complete graphs
- Calculating genus polynomials via string operations and matrices
- Counting orientable embeddings by genus for a type of 3-regular graph
- Rates of convergence for the embedding distributions of generalized linear graph families
- A tight lower bound on the maximum genus of a simplicial graph
- The genus polynomials of cross-ladder digraphs in orientable surfaces
- Partial-dual Euler-genus distributions for bouquets with small Euler genus
- On the number of maximum genus embeddings of almost all graphs
- Regular graph coverings whose covering transformation groups have the isomorphism extension property
This page was built for publication: Hierarchy for imbedding-distribution invariants of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3784089)
