Enumeration of simple complete topological graphs
From MaRDI portal
Publication:5902255
DOI10.1016/j.ejc.2009.03.005zbMath1228.05175OpenAlexW1978917076MaRDI QIDQ5902255
Publication date: 30 November 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2009.03.005
Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)
Related Items (21)
Recognizing and drawing IC-planar graphs ⋮ Complete graph drawings up to triangle mutations ⋮ Order on order types ⋮ Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth ⋮ Recognizing IC-Planar and NIC-Planar Graphs ⋮ Improved enumeration of simple topological graphs ⋮ \(\mathsf{NIC}\)-planar graphs ⋮ Simple realizability of complete abstract topological graphs simplified ⋮ Shooting stars in simple drawings of \(K_{m,n}\) ⋮ Simple realizability of complete abstract topological graphs in P ⋮ Recognizing optimal 1-planar graphs in linear time ⋮ Unnamed Item ⋮ Characterizing and recognizing 4-map graphs ⋮ On plane subgraphs of complete topological drawings ⋮ Embedding-preserving rectangle visibility representations of nonplanar graphs ⋮ Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees ⋮ Taking a detour; or, Gioan's theorem, and pseudolinear drawings of complete graphs ⋮ Polyline drawings with topological constraints ⋮ Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees ⋮ Quantitative Restrictions on Crossing Patterns ⋮ Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$
Cites Work
This page was built for publication: Enumeration of simple complete topological graphs
