Many disjoint edges in topological graphs

DOI10.1016/j.endm.2015.07.006zbMath1347.05045arXiv1412.3833OpenAlexW2755141850MaRDI QIDQ5890932

Andres J. Ruiz-Vargas

Publication date: 17 October 2016

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

Full work available at URL: https://arxiv.org/abs/1412.3833

zbMATH Keywords

complete graphtopological graphscylindrical graphsdisjoint edgesgraph drawings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Saturated simple and \(k\)-simple topological graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ramsey-type theorems
• Density theorems for bipartite graphs and related Ramsey-type results
• Optimal packing and covering in the plane are NP-complete
• Label placement by maximum independent set in rectangles
• Unavoidable configurations in complete topological graphs
• Quasi-optimal range searching in spaces of finite VC-dimension
• Research Problems in Discrete Geometry
• Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
• Coloring k _k -free intersection graphs of geometric objects in the plane
• Approximation schemes for covering and packing problems in image processing and VLSI
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Estimating the Number of Disjoint Edges in Simple Topological Graphs via Cylindrical Drawings
• Topological graphs
• Combinatorial Geometry and Graph Theory
• Disjoint edges in complete topological graphs

This page was built for publication: Many disjoint edges in topological graphs