Genus polynomials and crosscap‐number polynomials for ring‐like graphs
From MaRDI portal
Publication:5378435
Recommendations
- Genus of total graphs from rings: A survey
- The genus polynomials of cross-ladder digraphs in orientable surfaces
- On the genus of graphs from commutative rings
- An Euler-genus approach to the calculation of the crosscap-number polynomial
- Genus polynomials for three types of graphs.
- Some bounds for the genus of a class of graphs arising from rings
- On the genus of the graph associated to a commutative ring
- On the genus of the total graph of a commutative ring
- Genus of total graphs of commutative rings: a survey
- Genus polynomials of cycles with double edges
Cited in
(9)- Genus distributions for several types of ladder-class graphs
- Limits for embedding distributions
- Genus polynomials of ladder-like sequences of graphs
- Limit for the Euler-genus distributions of ladder-like sequences of graphs
- Log-concavity of the genus polynomials of Ringel ladders
- Enumerating graph embeddings and partial-duals by genus and Euler genus
- New bounds for the average genus and average number of faces of a simple graph
- Embeddings of circular ladder-like graph families
- Rates of convergence for the embedding distributions of generalized linear graph families
This page was built for publication: Genus polynomials and crosscap‐number polynomials for ring‐like graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378435)