Upper embeddability, edge independence number and girth

DOI10.1007/s11425-009-0002-1zbMath1185.05047OpenAlexW2067191821MaRDI QIDQ1044280

Ling Tang, Zhang Dong Ouyang, Yuan Qiu Huang

Publication date: 11 December 2009

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

Full work available at URL: https://doi.org/10.1007/s11425-009-0002-1

zbMATH Keywords

upper embeddability

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Exponentially many maximum genus embeddings and genus embeddings for complete graphs
• How to determine the maximum genus of a graph
• Upper-embeddable graphs and related topics
• Maximum genus and chromatic number of graphs
• On the average crosscap number. II: Bounds for a graph
• Up-embeddability of a graph by order and girth
• On the maximum genus of a graph
• A new characterization of the maximum genus of a graph
• A Characterization in of Upper-Embeddable Graphs

This page was built for publication: Upper embeddability, edge independence number and girth