On graphs, which can be drawn on an orientable surface with small number of intersections on an edge

DOI10.1007/S10958-016-2702-8zbMATH Open1337.05027OpenAlexW2298666713MaRDI QIDQ291177

Olga E. Samoilova

Publication date: 7 June 2016

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-016-2702-8

zbMATH Keywords

\(k\)-nearly \(g\)-spherical graph

Mathematics Subject Classification ID

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

Cites Work

• Graphs drawn with few crossings per edge

Related Items (1)

Edge‐maximal graphs on orientable and some nonorientable surfaces

This page was built for publication: On graphs, which can be drawn on an orientable surface with small number of intersections on an edge