Lower bounds for the maximum genus of 4-regular graphs

MaRDI QIDQ4911386zbMATH OpenFDO

Authors D. Zhou, Weili He, Rong-Xia Hao

Publication date 14 March 2013

zbMATH Keywords

Betti numbermaximum genusupper embeddable

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• Maximum genus of regular graphs
• On the lower bounds for the maximum genus for simple graphs
• Lower bounds on the maximum genus of a connected graph
• Maximum genus and connectivity
• Maximum genus, connectivity, and Nebeský's theorem

Cited in

(4)

• Maximum genus of regular graphs
• scientific article; zbMATH DE number 6136740 (Why is no real title available?)
• Lower bound for the number of 4-element generating sets of direct products of two neighboring partition lattices
• Genus ranges of 4-regular rigid vertex graphs

This page was built for publication: Lower bounds for the maximum genus of 4-regular graphs

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