The maximum genus of graphs with diameter three

DOI10.1016/S0012-365X(98)00037-5zbMath0939.05028OpenAlexW2015617500MaRDI QIDQ1297478

Yanpei Liu, Yuan Qiu Huang

Publication date: 9 August 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00037-5

zbMATH Keywords

surfacemaximum genusBetti numbercellular embeddingcycle rank

Mathematics Subject Classification ID

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

Related Items (5)

Maximum genus and chromatic number of graphs ⋮ The genus polynomials of cross-ladder digraphs in orientable surfaces ⋮ Results of the maximum genus of graphs ⋮ Maximum genus, girth and connectivity ⋮ Maximum genus, connectivity and minimal degree of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of maximum genus embeddings of almost all graphs
• Upper-embeddable graphs and related topics
• Maximum genus and connectivity
• A tight lower bound on the maximum genus of a simplicial graph
• The maximum genus of graphs of diameter two
• On the maximum genus of a graph
• A new characterization of the maximum genus of a graph
• The Maximum Genus of Cartesian Products of Graphs
• The embeddings of a graph—A survey

This page was built for publication: The maximum genus of graphs with diameter three