A class of upper-embeddable graphs

DOI10.1002/jgt.3190030409zbMath0424.05022OpenAlexW1936965644MaRDI QIDQ3858286

François Jaeger, Charles Payan, Nguyen Huy Xuong

Publication date: 1979

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190030409

zbMATH Keywords

maximum genusBetti numberupper-embeddable

Mathematics Subject Classification ID

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

Related Items (6)

Maximum genus and chromatic number of graphs ⋮ Up-embeddability of a graph by order and girth ⋮ Results of the maximum genus of graphs ⋮ A sufficient condition on upper embeddability of graphs ⋮ Up-embeddability via girth and the degree-sum of adjacent vertices ⋮ Upper embeddability, girth and the degree-sum of nonadjacent vertices

Cites Work

• How to determine the maximum genus of a graph
• Upper-embeddable graphs and related topics
• On the maximum genus of a graph
• Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings
• Unnamed Item

This page was built for publication: A class of upper-embeddable graphs