Publication:5692715
From MaRDI portal
zbMath1079.52505MaRDI QIDQ5692715
Publication date: 28 September 2005
68Q25: Analysis of algorithms and problem complexity
52A37: Other problems of combinatorial convexity
Related Items
Connecting Red Cells in a Bicolour Voronoi Diagram, Separated Matchings and Small Discrepancy Colorings, Geometric Graphs in the Plane Lattice, Monochromatic empty triangles in two-colored point sets, Computing optimal islands, Universal point sets for 2-coloured trees, Balanced partitions of 3-colored geometric sets in the plane, On the connectivity of visibility graphs, Vertex-colored encompassing graphs, Bounds for point recolouring in geometric graphs, Long alternating paths in bicolored point sets, Bicolored graph partitioning, or: gerrymandering at its worst, Drawing colored graphs with constrained vertex positions and few bends per edge, Planar bichromatic minimum spanning trees, Noncrossing monochromatic subtrees and staircases in 0-1 matrices, Monochromatic geometric \(k\)-factors for bicolored point sets with auxiliary points, A note on harmonic subgraphs in labelled geometric graphs, Carathéodory's theorem in depth, Encompassing colored planar straight line graphs, Monochromatic geometric k-factors in red-blue sets with white and Steiner points, Properly Colored Geometric Matchings and 3-Trees Without Crossings on Multicolored Points in the Plane, Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position, Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph, Hamiltonian Alternating Paths on Bicolored Double-Chains
