The following pages link to (Q5692715):
Displayed 50 items.
- Alternating paths and cycles of minimum length (Q340546) (← links)
- Monochromatic empty triangles in two-colored point sets (Q385155) (← links)
- Computing optimal islands (Q433119) (← links)
- Universal point sets for 2-coloured trees (Q436323) (← links)
- Balanced partitions of 3-colored geometric sets in the plane (Q479011) (← links)
- Computing the coarseness with strips or boxes (Q526818) (← links)
- Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon (Q679748) (← links)
- On the connectivity of visibility graphs (Q715001) (← links)
- Extended box clustering for classification problems (Q724605) (← links)
- Vertex-colored encompassing graphs (Q742604) (← links)
- Diverse partitions of colored points (Q832914) (← links)
- Bounds for point recolouring in geometric graphs (Q924089) (← links)
- Long alternating paths in bicolored point sets (Q941368) (← links)
- Bicolored graph partitioning, or: gerrymandering at its worst (Q967425) (← links)
- Drawing colored graphs with constrained vertex positions and few bends per edge (Q973017) (← links)
- Planar bichromatic minimum spanning trees (Q1044035) (← links)
- Plane bichromatic trees of low degree (Q1650794) (← links)
- Linear transformation distance for bichromatic matchings (Q1699281) (← links)
- On Hamiltonian alternating cycles and paths (Q1699287) (← links)
- The hamburger theorem (Q1699288) (← links)
- Colored spanning graphs for set visualization (Q1699297) (← links)
- Colored ray configurations (Q1699300) (← links)
- A note on two geometric paths with few crossings for points labeled by integers in the plane (Q1699559) (← links)
- Stabbing segments with rectilinear objects (Q1738129) (← links)
- Rainbow polygons for colored point sets in the plane (Q2032728) (← links)
- Structural properties of bichromatic non-crossing matchings (Q2247147) (← links)
- Noncrossing monochromatic subtrees and staircases in 0-1 matrices (Q2249949) (← links)
- Monochromatic geometric \(k\)-factors for bicolored point sets with auxiliary points (Q2350591) (← links)
- A note on harmonic subgraphs in labelled geometric graphs (Q2380050) (← links)
- Near equipartitions of colored point sets (Q2401334) (← links)
- Carathéodory's theorem in depth (Q2408186) (← links)
- Pruning boxes in a box-based classification method (Q2418270) (← links)
- Supervised box clustering (Q2418297) (← links)
- Encompassing colored planar straight line graphs (Q2456662) (← links)
- Discrete geometry on colored point sets in the plane -- a survey (Q2657063) (← links)
- Geometric planar networks on bichromatic collinear points (Q2664940) (← links)
- On geometric graphs on point sets in the plane (Q2695466) (← links)
- Monochromatic geometric k-factors in red-blue sets with white and Steiner points (Q2851455) (← links)
- Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane (Q2945669) (← links)
- Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position (Q3419616) (← links)
- Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph (Q3439409) (← links)
- Hamiltonian Alternating Paths on Bicolored Double-Chains (Q3611851) (← links)
- Weight-Equitable Subdivision of Red and Blue Points in the Plane (Q4634475) (← links)
- Connecting Red Cells in a Bicolour Voronoi Diagram (Q4899279) (← links)
- Separated Matchings and Small Discrepancy Colorings (Q4899284) (← links)
- Geometric Graphs in the Plane Lattice (Q4899287) (← links)
- A survey of mass partitions (Q5067418) (← links)
- Planar Bichromatic Bottleneck Spanning Trees (Q5874461) (← links)
- The balanced connected subgraph problem (Q5918764) (← links)
- Monochromatic partitioning of colored points by lines (Q6161462) (← links)