Characterizing Containment and Related Classes of Graphs,

Abstract

A graph is a containment graph if one can assign sets to its vertices such that two vertices are adjacent if and only if a set assigned to one contains the set assigned to the other. A containment class of graphs is formed by considering all containment graphs for which the sets assigned to the vertices must be from a prespecified family of sets. A characterization of containment classes of graphs is presented as well as characterizations for overlap and disjointedness classes. These results are compared with previous results on intersection classes of graphs.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1985
Accession Number
ADA163365

Entities

People

  • Edward R. Scheinerman

Organizations

  • Johns Hopkins University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Continents
  • Geographic Regions
  • Graph Theory
  • Maryland
  • Military Research
  • New York
  • North America
  • Orientation (Direction)
  • Sequences
  • United States
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research
  • Strategic Security Studies