On the average crosscap number. II: Bounds for a graph

DOI10.1007/s11425-007-2082-0zbMath1122.05027OpenAlexW2012319620MaRDI QIDQ2372524

Yanpei Liu, Yi-Chao Chen

Publication date: 30 July 2007

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-007-2082-0

zbMATH Keywords

boundsaverage genusaverage crosscap number

Mathematics Subject Classification ID

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

Related Items

Remarks on the lower bounds for the average genus ⋮ Upper embeddability, edge independence number and girth

Cites Work

• Unnamed Item
• Region distributions of graph embeddings and Stirling numbers
• Permutation-partition pairs. III: Embedding distributions of linear families of graphs
• Limit points for average genus. II: 2-connected non-simplicial graphs
• Kuratowski-type theorems for average genus
• Overlap matrices and total imbedding distributions
• Bounds for the average genus of the vertex-amalgamation of graphs
• A tight lower bound on the maximum genus of a simplicial graph
• A Kuratowski-type theorem for the maximum genus of a graph
• Generalized Embedding Schemes
• Lower bounds for the average genus
• On the average genus of the random graph