Enumeration of simple complete topological graphs

DOI10.1016/j.endm.2007.07.051zbMath1341.05126OpenAlexW1971023011MaRDI QIDQ5900075

Jan Kynčl

Publication date: 5 June 2008

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2007.07.051

zbMATH Keywords

isomorphism classesHarborth and Mengersen estimate

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (2)

Enumeration of simple complete topological graphs ⋮ The Complexity of Several Realizability Problems for Abstract Topological Graphs

Cites Work

• Proof of a conjecture of Burr, Grünbaum, and Sloane
• On the number of arrangements of pseudolines
• Graph Drawing
• Unnamed Item

This page was built for publication: Enumeration of simple complete topological graphs