scientific article; zbMATH DE number 7828127

DOI10.12386/a20210108MaRDI QIDQ6123703

Unnamed Author, Yi-Chao Chen

Publication date: 8 April 2024

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

asymptotic normalityembeddinggenus distributioncircular ladder-like graphsMöbius ladderlike graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum genus embeddings of the complete graph
• On the genus distribution of \((p,q,n)\)-dipoles
• Permutation-partition pairs. III: Embedding distributions of linear families of graphs
• On the genus distributions of wheels and of related graphs
• Limits for embedding distributions
• A character approach to directed genus distribution of graphs: the bipartite single-black-vertex case
• Genus polynomials of ladder-like sequences of graphs
• Exponentially many genus embeddings of the complete graph \(K_{12s+3}\)
• Classification of \((p,q,n)\)-dipoles on nonorientable surfaces
• Hierarchy for imbedding-distribution invariants of a graph
• An Euler‐genus approach to the calculation of the crosscap‐number polynomial
• Calculating genus polynomials via string operations and matrices
• Recurrences for the genus polynomials of linear sequences of graphs
• Genus polynomials and crosscap‐number polynomials for ring‐like graphs
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM

This page was built for publication: