Geometric spanning cycles in bichromatic point sets

DOI10.1007/s00373-015-1545-2zbMath1312.05039arXiv1502.04328OpenAlexW3104976496MaRDI QIDQ2345513

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

geometric graphsbichromatic point setsHamiltonean 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)

Related Items

Monochromatic plane matchings in bicolored point set

Cites Work

• On plane spanning trees and cycles of multicolored point sets with few intersections
• Simple alternating path problem
• Bipartite embeddings of trees in the plane
• Intersection number of two connected geometric graphs
• On the length of longest alternating paths for multicoloured point sets in convex position
• On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets
• Discrete Geometry on Red and Blue Points in the Plane Lattice