Limit for the Euler-genus distributions of ladder-like sequences of graphs
From MaRDI portal
Publication:2240732
DOI10.1007/s10801-021-01014-0zbMath1477.05093OpenAlexW3123107397MaRDI QIDQ2240732
Xiang Lin Zhang, Jinlian Zhang, Xu-hui Peng
Publication date: 4 November 2021
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-021-01014-0
Graph polynomials (05C31) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total embedding distributions of Ringel ladders
- Genus distributions of star-ladders
- Genus distributions for two classes of graphs
- Permutation-partition pairs. III: Embedding distributions of linear families of graphs
- An obstruction to embedding graphs in surfaces
- Genus distributions for bouquets of circles
- Overlap matrices and total imbedding distributions
- Genus distribution of Ringel ladders
- On the genus distributions of wheels and of related graphs
- Embedding distributions and Chebyshev polynomials
- Limits for embedding distributions
- Genus polynomials of ladder-like sequences of graphs
- Quadrangular embeddings of complete graphs and the even map color theorem
- Orientable embedding genus distribution for certain types of graphs
- An Euler‐genus approach to the calculation of the crosscap‐number polynomial
- Calculating genus polynomials via string operations and matrices
- Genus polynomials and crosscap‐number polynomials for ring‐like graphs
This page was built for publication: Limit for the Euler-genus distributions of ladder-like sequences of graphs