Skip to main content
SpringerLink
Log in

From Intersectors to Successors

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 A geometric graph any two line segments of which intersect is called an intersector. This notion will be generalized in order to obtain new results which are not true for this (restricted) category.

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

Similar content being viewed by others

Author information

Authors and Affiliations

  1.  Mathematical Institute, The Hebrew University of Jerusalem, Jerusalem, Israel, , , , , , IL

    Yaakov S. Kupitz

  2.  Mathematische Fakultät, Technische Universität Chemnitz, D-09107 Chemnitz, Germany. e-mail: martini@mathematik.tu-chemnitz.de, , , , , , DE

    Horst Martini

Authors
  1. Yaakov S. Kupitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Horst Martini
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: December 8, 1997 Final version received: January 12, 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kupitz, Y., Martini, H. From Intersectors to Successors. Graphs Comb 17, 99–111 (2001). https://doi.org/10.1007/s003730170058

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730170058

Keywords

Search

Navigation