Results of the maximum genus of graphs

DOI10.1007/s11425-007-0069-5zbMath1133.05022OpenAlexW2067219603MaRDI QIDQ2475314

Yanpei Liu, Guanghua Dong

Publication date: 11 March 2008

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

Full work available at URL: https://doi.org/10.1007/s11425-007-0069-5

zbMATH Keywords

diametermaximum genusup-embeddable

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to determine the maximum genus of a graph
• The maximum genus of graphs with diameter three
• Maximum genus and chromatic number of graphs
• The decay number and the maximum genus of diameter 2 graphs
• Bounds of the number of disjoint spanning trees
• Face size and the maximum genus of a graph. I: Simple graphs
• A class of upper-embeddable graphs
• On some extremal graphs

This page was built for publication: Results of the maximum genus of graphs