Up-embeddability via girth and the degree-sum of adjacent vertices

DOI10.1007/s11425-008-0126-8zbMath1182.05041OpenAlexW2021689631MaRDI QIDQ1042914

Yanpei Liu, Guanghua Dong

Publication date: 7 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-008-0126-8

zbMATH Keywords

up-embeddable graphs

Mathematics Subject Classification ID

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

Related Items (1)

Up-embeddability of graphs with new degree-sum

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to determine the maximum genus of a graph
• Maximum genus and chromatic number of graphs
• Bounds of the number of disjoint spanning trees
• Face size and the maximum genus of a graph. I: Simple graphs
• The maximum genus of graphs of diameter two
• On the maximum genus of a graph
• A class of upper-embeddable graphs
• Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings

This page was built for publication: Up-embeddability via girth and the degree-sum of adjacent vertices