The following pages link to (Q5692715):
Displayed 24 items.
- 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)
- On the connectivity of visibility graphs (Q715001) (← links)
- Vertex-colored encompassing graphs (Q742604) (← 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)
- 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)
- Carathéodory's theorem in depth (Q2408186) (← links)
- Encompassing colored planar straight line graphs (Q2456662) (← 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)
- 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)