A characterization of graphs with interval two-step graphs
By: by J. Richard Lundgren, Sarah K. Merz, John S. Maybee, Craig W. Rasmussen
Contributors: Merz, Sarah K.; Maybee, John Stanley; Rasmussen, Craig W.; Naval Postgraduate School (U.S.). Dept. of Mathematics
Publisher: Naval Postgraduate School; Available from National Technical Information Service
Published: 1993
Place of publication: Monterey, Calif; Springfield, Va
Language: eng
Number of pages: 16
Subjects: GRAPHS
Other titles: NPS-MA-93-021.
Description: One of the intriguing open problems on competition graphs is determining what digraphs have      interval competition graphs. In this paper we consider this problem for the class of loopless      symmetric digraphs. Here we first consider forbidden subgraph characterizations of graphs      with interval two- step graphs. We then characterize a large class of graphs with interval      two-step graphs, using the Fulkerson-Gross characterization of interval graphs. Interval      graphs, Competition graphs, Step graphs.
Notes: Cover title.

"NPS-MA-93-021."

"Technical report for period April 1993 - July 1993."

AD A275 652.

Includes bibliographical references (p. 16)

aq/  /aq cc:9116 09/12/97