Properly colored geometric matchings and 3-trees without crossings on multicolored points in the plane
DOI10.1007/978-3-319-13287-7_9zbMATH Open1452.05064OpenAlexW1001549597MaRDI QIDQ2945669FDOQ2945669
Authors: Kazuhiro Suzuki, Miyuki Uno, Mikio Kano
Publication date: 14 September 2015
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-13287-7_9
Recommendations
alternating treesequence of pointsred and blue pointsalternating matchingmulticolored pointsproperly colored geometric graph
Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
Cites Work
Cited In (10)
- On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets
- The hamburger theorem
- An optimal algorithm for plane matchings in multipartite geometric graphs
- Twenty years of progress of \(\mathrm{JCDCG}^3\)
- Convex equipartitions of colored point sets
- Rainbow polygons for colored point sets in the plane
- Near equipartitions of colored point sets
- Discrete geometry on colored point sets in the plane -- a survey
- An optimal algorithm for plane matchings in multipartite geometric graphs
- Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
This page was built for publication: Properly colored geometric matchings and 3-trees without crossings on multicolored points in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945669)