Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane

DOI10.1007/978-3-319-13287-7_9zbMath1452.05064OpenAlexW1001549597MaRDI QIDQ2945669

Miyuki Uno, Kazuhiro Suzuki, 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

zbMATH Keywords

alternating treesequence of pointsred and blue pointsalternating matchingmulticolored pointsproperly colored geometric graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (10)

An optimal algorithm for plane matchings in multipartite geometric graphs ⋮ An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs ⋮ Plane bichromatic trees of low degree ⋮ Discrete geometry on colored point sets in the plane -- a survey ⋮ Near equipartitions of colored point sets ⋮ The hamburger theorem ⋮ Convex equipartitions of colored point sets ⋮ Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon ⋮ Rainbow polygons for colored point sets in the plane ⋮ Twenty years of progress of \(\mathrm{JCDCG}^3\)

Cites Work

• Problem-solving through problems
• Vertex-colored encompassing graphs
• Discrete Geometry on Red and Blue Points in the Plane Lattice
• Unnamed Item
• Unnamed Item

This page was built for publication: Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane