Blockers for triangulations of a convex polygon and a geometric maker-breaker game
From MaRDI portal
Publication:2205124
DOI10.37236/7205zbMath1450.05013arXiv1801.00324OpenAlexW3094152621MaRDI QIDQ2205124
Publication date: 20 October 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.00324
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Games involving graphs (91A43) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Unnamed Item
- Characterization of co-blockers for simple perfect matchings in a convex geometric graph
- Blockers for simple Hamiltonian paths in convex geometric graphs of even order
- Fast winning strategies in avoider-enforcer games
- Triangulations. Structures for algorithms and applications
- A Turán-type theorem on chords of a convex polygon
- Geometric tree graphs of points in convex position
- \(Y\)-systems and generalized associahedra
- On the smallest sets blocking simple perfect matchings in a convex geometric graph
- The associahedron and triangulations of the \(n\)-gon
- On line arrangements in the hyperbolic plane
- Extremal theory for convex matchings in convex geometric graphs
- Graph of triangulations of a convex polygon and tree of triangulations
- Algorithms for optimal area triangulations of a convex polygon
- Coxeter complexes and graph-associahedra
- The number of caterpillars
- Blockers for Noncrossing Spanning Trees in Complete Geometric Graphs
- Remarks on positional games. I
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Minimal Triangulations of Polygonal Domains
- Positional Games
- Homotopy Associativity of H-Spaces. I
- On a combinatorial game
- Permutrees
This page was built for publication: Blockers for triangulations of a convex polygon and a geometric maker-breaker game
