TY - JOUR
T1 - Not All Graphs are Segment T-graphs
AU - Alon, Noga
AU - Katchalski, Meir
AU - Scheinerman, Edward R.
PY - 1990
Y1 - 1990
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0006687208&partnerID=8YFLogxK
U2 - 10.1016/S0195-6698(13)80050-9
DO - 10.1016/S0195-6698(13)80050-9
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0006687208
SN - 0195-6698
VL - 11
SP - 7
EP - 13
JO - European Journal of Combinatorics
JF - European Journal of Combinatorics
IS - 1
ER -