Up-embeddability of graphs with new degree-sum

DOI10.1007/s10255-017-0647-4zbMath1359.05084OpenAlexW2612756700MaRDI QIDQ523775

Meng-da Fu, Shengxiang Lv, Yanpei Liu

Publication date: 21 April 2017

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-017-0647-4

zbMATH Keywords

maximum genusdegree-sumup-embeddability

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Up-embeddability of graphs with small order
• Up-embeddability via girth and the degree-sum of adjacent vertices
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Up-embeddability of graphs with new degree-sum