On geometric graphs on point sets in the plane

DOI10.1007/978-3-030-90048-9_1OpenAlexW3208775066MaRDI QIDQ2695466

Jorge Urrutia

Publication date: 31 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-90048-9_1

Mathematics Subject Classification ID

Applications of game theory (91A80) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monochromatic empty triangles in two-colored point sets
• Empty monochromatic triangles
• On plane spanning trees and cycles of multicolored point sets with few intersections
• Simple alternating path problem
• A note on balanced colourings for lattice points
• Long alternating paths in bicolored point sets
• A matching problem in the plane
• Bipartite embeddings of trees in the plane
• Algorithms for ham-sandwich cuts
• Crossing families
• Intersection number of two connected geometric graphs
• Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
• On Hamiltonian alternating cycles and paths
• A note on harmonic subgraphs in labelled geometric graphs
• On the length of longest alternating paths for multicoloured point sets in convex position
• On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets
• The Mathematics of Ferran Hurtado: A Brief Survey
• Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons
• Sets with No Empty Convex 7-Gons
• ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
• Combinatorial Geometry and Graph Theory
• Discrete and Computational Geometry

This page was built for publication: On geometric graphs on point sets in the plane