Shady Copty, Shai Fine, et al.
Theoretical Computer Science
While graphs are normally defined in terms of the 2-place relation of adjacency, we take the 3-place relation of interception as the basic primitive of their definition. The paper views graphs as an economical scheme for encoding interception relations, and establishes an axiomatic characterization of relations that lend themselves to representation in terms of graph interception, thus providing a new characterization of graphs. © 1996 John Wiley & Sons, Inc.
Shady Copty, Shai Fine, et al.
Theoretical Computer Science
Yaniv Eytani, Rachel Tzoref, et al.
ICSTW 2008
Raanan Grinwald, Eran Harel, et al.
DAC 1998
Yoram Adler, Noam Behar, et al.
ICSE 2011