Skip to main content
SpringerLink
Log in

Geometric Spanning Cycles in Bichromatic Point Sets

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Abellanas, M., Garcıa, J., Hernández, G., Noy, M., Ramos, P.: Bipartite embeddings of trees in the plane. Discret. Appl. Math. 93(2), 141–148 (1999)

    Article  MATH  Google Scholar 

  2. Akiyama, J., Urrutia, J.: Simple alternating path problem. Discret. Math. 84(1), 101–103 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  3. Kano, M., Merino, C., Urrutia, J.: On plane spanning trees and cycles of multicolored point sets with few intersections. Inf. Process. Lett. 93(6), 301–306 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  4. Kano, M., Suzuki, K.: Discrete geometry on red and blue points in the plane lattice. In: Thirty Essays on Geometric Graph Theory, pp. 355–369. Springer, Berlin (2013)

  5. Merino, C., Salazar, G., Urrutia, J.: On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets. Graphs Comb. 21(3), 333–341 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  6. Merino, C., Salazar, G., Urrutia, J.: On the length of longest alternating paths for multicoloured point sets in convex position. Discret. Math. 306(15), 1791–1797 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  7. Tokunaga, S.-I.: Intersection number of two connected geometric graphs. Inf. Process. Lett. 59(6), 331–333 (1996)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

We would like to thank the referees for carefully reading our paper. Their comments were very useful and helped us to improve on the quality of our final manuscript.

Author information

Authors and Affiliations

  1. University of Waterloo, Waterloo, ON, Canada

    B. Joeris

  2. University of Toronto, Toronto, ON, Canada

    I. Urrutia

  3. Instituto de Matemáticas, UNAM, Mexico, Mexico

    J. Urrutia

Authors
  1. B. Joeris
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Urrutia
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. Urrutia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to B. Joeris.

Additional information

J. Urrutia was supported by Grant number 178379 Conacyt, México.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Joeris, B., Urrutia, I. & Urrutia, J. Geometric Spanning Cycles in Bichromatic Point Sets. Graphs and Combinatorics 31, 453–465 (2015). https://doi.org/10.1007/s00373-015-1545-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-015-1545-2

Keywords

Search

Navigation