Not All Graphs are Segment T-graphs

Noga Alon; Meir Katchalski; Edward R. Scheinerman

doi:10.1016/S0195-6698(13)80050-9

Not All Graphs are Segment T-graphs

Noga Alon, Meir Katchalski, Edward R. Scheinerman

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Pages (from-to)	7-13
Number of pages	7
Journal	European Journal of Combinatorics
Volume	11
Issue number	1
DOIs	https://doi.org/10.1016/S0195-6698(13)80050-9
State	Published - 1990
Externally published	Yes

All Science Journal Classification (ASJC) codes

Discrete Mathematics and Combinatorics

Access to Document

10.1016/S0195-6698(13)80050-9

Cite this

@article{99685e4534be48c9851174fcfa490638,

title = "Not All Graphs are Segment T-graphs",

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.",

author = "Noga Alon and Meir Katchalski and Scheinerman, {Edward R.}",

year = "1990",

doi = "10.1016/S0195-6698(13)80050-9",

language = "English (US)",

volume = "11",

pages = "7--13",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press",

number = "1",

}

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

UR - http://www.scopus.com/inward/citedby.url?scp=0006687208&partnerID=8YFLogxK

U2 - 10.1016/S0195-6698(13)80050-9

DO - 10.1016/S0195-6698(13)80050-9

M3 - 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 -

Not All Graphs are Segment T-graphs

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this