Not All Graphs are Segment T-graphs

Noga Mordechai Alon, Meir Katchalski, Edward R. Scheinerman

Research output: Contribution to journalArticle

3 Scopus citations

Abstract

Given two line segments in the plane, we say they are in T-position if the line containing one of the segments intersects the other segment. A segment T-graph has its vertices in one-to-one correspondence with pairwise disjoint planar line segments so that two vertices are adjacent iff they are in T-position. We give two proofs that not all graphs are segment T-graphs.

Original languageEnglish (US)
Pages (from-to)7-13
Number of pages7
JournalEuropean Journal of Combinatorics
Volume11
Issue number1
DOIs
StatePublished - Jan 1 1990
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Not All Graphs are Segment T-graphs'. Together they form a unique fingerprint.

  • Cite this