Geometric spanning cycles in bichromatic point sets

DOI10.1007/S00373-015-1545-2MaRDI QIDQ2345513zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 22 May 2015

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1502.04328

zbMATH Keywords

bichromatic point setsgeometric graphsHamiltonean cycles

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Abstract: Given a set of points in the plane each colored either red or blue, we find non-self-intersecting geometric spanning cycles of the red points and of the blue points such that each edge of the red spanning cycle is crossed at most three times by the blue spanning cycle and vice-versa.

Recommendations

• Intersection number of two connected geometric graphs
• On the red/blue spanning tree problem
• On the Red/Blue Spanning Tree Problem
• scientific article; zbMATH DE number 2145233
• Connecting colored point sets

Cites work

• Bipartite embeddings of trees in the plane
• Discrete geometry on red and blue points in the plane lattice
• Intersection number of two connected geometric graphs
• On plane spanning trees and cycles of multicolored point sets with few intersections
• On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets
• On the length of longest alternating paths for multicoloured point sets in convex position
• Simple alternating path problem

Cited in

(3)

• Intersection number of two connected geometric graphs
• Colored ray configurations
• Monochromatic plane matchings in bicolored point set

This page was built for publication: Geometric spanning cycles in bichromatic point sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345513)