Rates of convergence for the embedding distributions of generalized linear graph families
From MaRDI portal
Publication:6670785
DOI10.12386/A20230012MaRDI QIDQ6670785
Qiyao Chen, Jinlian Zhang, Xuhui Peng
Publication date: 24 January 2025
Published in: Acta Mathematica Sinica. Chinese Series (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Genus distributions of 4-regular outerplanar graphs
- Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
- Genus distributions for two classes of graphs
- Permutation-partition pairs. III: Embedding distributions of linear families of graphs
- Kuratowski-type theorems for average genus
- Genus distributions for bouquets of circles
- Total embedding distributions for bouquets of circles
- Embedding distributions and Chebyshev polynomials
- Limits for embedding distributions
- Genus polynomials of ladder-like sequences of graphs
- Limit for the Euler-genus distributions of ladder-like sequences of graphs
- Orientable embedding genus distribution for certain types of graphs
- Genus distributions of graphs under edge-amalgamations
- Hierarchy for imbedding-distribution invariants of a graph
- An Euler‐genus approach to the calculation of the crosscap‐number polynomial
- Genus polynomials and crosscap‐number polynomials for ring‐like graphs
This page was built for publication: Rates of convergence for the embedding distributions of generalized linear graph families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6670785)