DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click
HERE to register or log in.
Accession Number:
ADA010052
Title:
A Sufficient Condition for Realizability of Constrained Graphs.
Corporate Author:
WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER
Report Date:
1975-02-01
Abstract:
A constrained graph G is realizable if it is the intersection graph of a collection of arcs in the unit disk D sup 2, where each arc is required to intersect exactly one distinct boundary point of D sup 2, and the ordering of these boundary points is specified by the constraints on G. In this paper the author obtains a new sufficient condition for a constrained graph to be realizable. This extends work previously done by F. W. Sinden of Bell Labs.
Descriptive Note:
Technical summary rept.,
Pages:
0029
Contract Number:
DA-31-124-ARO-D-462
File Size:
0.00MB
