Upper embeddability, girth and the degree-sum of nonadjacent vertices

DOI10.1007/s00373-008-0837-1zbMath1184.05037OpenAlexW2007459928MaRDI QIDQ1043810

Jing Wang, Yuan Qiu Huang, Zhang Dong Ouyang

Publication date: 9 December 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-008-0837-1

zbMATH Keywords

graphindependence numbergirthmaximum genusupper embeddability

Mathematics Subject Classification ID

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

Cites Work

• How to determine the maximum genus of a graph
• Maximum genus and chromatic number of graphs
• On the maximum genus of a graph
• A class of upper-embeddable graphs
• Every connected, locally connected graph is upper embeddable
• 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: Upper embeddability, girth and the degree-sum of nonadjacent vertices