Up-embeddability of graphs with small order

DOI10.1016/j.aml.2009.10.001zbMath1227.05134OpenAlexW2017331178MaRDI QIDQ847307

Yanpei Liu, Shengxiang Lv

Publication date: 12 February 2010

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2009.10.001

zbMATH Keywords

maximum genusMoore boundup-embeddability

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

• On the maximum genus of a graph
• A new characterization of the maximum genus of a graph
• A Characterization in of Upper-Embeddable Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Up-embeddability of graphs with small order