A class of upper-embeddable graphs

DOI10.1002/JGT.3190030409MaRDI QIDQ3858286zbMATH OpenOpenAlexFDO

Authors 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

Betti numbermaximum genusupper-embeddable

Mathematics Subject Classification ID

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

Cites work

• Determining all compact orientable 2-manifolds upon which \(K_{m,n}\) has 2-cell imbeddings
• How to determine the maximum genus of a graph
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• On the maximum genus of a graph
• Upper-embeddable graphs and related topics

Cited in

(6)

• Up-embeddability via girth and the degree-sum of adjacent vertices
• Upper embeddability, girth and the degree-sum of nonadjacent vertices
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3858286)