scientific article; zbMATH DE number 4177080

MaRDI QIDQ3201069zbMATH OpenFDO

Authors Martin Škoviera, Roman Nedela

Publication date 1990

zbMATH Keywords

cyclic permutationdoubly Eulerian trailmaximum genusupper imbeddable

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1782451
• Maximum genus, dominate number and girth of a graph
• The maximum genus of graphs of diameter two
• scientific article; zbMATH DE number 3900781
• scientific article; zbMATH DE number 2147806

Cited in

(12)

• On the Euler genus of a 2-connected graph
• Extensions on 2-edge connected 3-regular up-embeddable graphs
• Maximum genus and chromatic number of graphs
• Results of the maximum genus of graphs
• Constructions of DNA and polypeptide cages based on plane graphs and odd crossing \(\pi \)-junctions
• Maximum genus of regular graphs
• scientific article; zbMATH DE number 3914375 (Why is no real title available?)
• scientific article; zbMATH DE number 1782451 (Why is no real title available?)
• scientific article; zbMATH DE number 2147806 (Why is no real title available?)
• scientific article; zbMATH DE number 907923 (Why is no real title available?)
• Bi-eulerian embeddings of graphs and digraphs
• Bidirectional retracting-free double tracings and upper embeddability of graphs

This page was built for publication:

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