Topological graphs with no self-intersecting cycle of length 4

DOI10.1145/777792.777807MaRDI QIDQ5361609zbMATH OpenOpenAlexFDO

Authors Radoa Radoicic, Rom Pinchasi

Publication date 29 September 2017

Published in Proceedings of the nineteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/777792.777807

zbMATH Keywords

extremal graph theoryself-intersecting cycletopological graphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2145243
• On the maximum number of edges in topological graphs with no four pairwise crossing edges
• On the maximum number of edges in topological graphs with no four pairwise crossing edges
• scientific article; zbMATH DE number 1974129
• Geometric graphs with no self-intersecting path of length three

Cited in

(7)

• Geometric graphs with no self-intersecting path of length three
• Intersection reverse sequences and geometric applications.
• scientific article; zbMATH DE number 1974129 (Why is no real title available?)
• scientific article; zbMATH DE number 2145243 (Why is no real title available?)
• Graph Drawing
• Spiraling and Folding: The Topological View
• Noncrossing Hamiltonian paths in geometric graphs

This page was built for publication: Topological graphs with no self-intersecting cycle of length 4

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