The Mathematics of Ferran Hurtado: A Brief Survey
From MaRDI portal
Publication:2958111
DOI10.1007/978-3-319-48532-4_25zbMath1491.52001MaRDI QIDQ2958111
Publication date: 1 February 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-48532-4_25
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
05C10: Planar graphs; geometric and topological aspects of graph theory
52-02: Research exposition (monographs, survey articles) pertaining to convex and discrete geometry
52C30: Planar arrangements of lines and pseudolines (aspects of discrete geometry)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Witness Gabriel graphs
- Monochromatic empty triangles in two-colored point sets
- On \(k\)-convex polygons
- On degrees in random triangulations of point sets
- Witness (Delaunay) graphs
- Connectivity augmentation in planar straight line graphs
- Blocking Delaunay triangulations
- Witness rectangle graphs
- Empty monochromatic triangles
- Simple alternating path problem
- Augmenting the connectivity of geometric graphs
- Long alternating paths in bicolored point sets
- Flips in planar graphs
- Planar packing of trees and spider trees
- Improved upper bounds on the reflexivity of point sets
- Triangulations, visibility graph and reflex vertices of a simple polygon
- On some problems of elementary and combinatorial geometry
- Bipartite embeddings of trees in the plane
- Hiding points in arrangements of segments
- Towards compatible triangulations.
- Chromatic variants of the Erdős--Szekeres theorem on points in convex position.
- Lower bounds on the number of crossing-free subgraphs of \(K_N\)
- Flipping edges in triangulations
- The associahedron and triangulations of the \(n\)-gon
- A lower bound on the number of triangulations of planar point sets
- Ears of triangulations and Catalan numbers
- On a partition into convex polygons
- Graph of triangulations of a convex polygon and tree of triangulations
- On \(k\)-convex point sets
- Geometric biplane graphs. I: Maximal graphs
- Geometric biplane graphs. II: Graph augmentation
- On the number of plane geometric graphs
- Compatible spanning trees
- On the length of longest alternating paths for multicoloured point sets in convex position
- Planar Packing of Binary Trees
- Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
- ON FLIPS IN POLYHEDRAL SURFACES
- Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons
- Packing trees into planar graphs
- Hamiltonian Alternating Paths on Bicolored Double-Chains
- Sets with No Empty Convex 7-Gons
- Crossing-Free Subgraphs
- On Rotations and the Generation of Binary Trees
- ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
- SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS
- Simultaneously Flippable Edges in Triangulations
- Counting Plane Graphs: Cross-Graph Charging Schemes
- Simultaneous diagonal flips in plane triangulations
