论文信息 - Interval competition graphs of symmetric diagraphs

Interval competition graphs of symmetric diagraphs

Abstract The competition graph of a loopless symmetric digraph H is the two-step graph , S 2 ( H ). Necessary and sufficient conditions on H are given for S 2 ( H ) to be interval or unit interval. These are useful properties when application requires that the competition graph be efficiently colorable. Computational aspects are discussed, as are related open problems.

John S. Maybee | J. Richard Lundgren | Craig W. Rasmussen

[1] P. Gilmore,et al. A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[2] J. Richard Lundgren,et al. Food Webs, Competition Graphs, Competition-Common Enemy Graphs, and Niche Graphs , 1989 .

[3] C. Lekkeikerker,et al. Representation of a finite graph by a set of intervals on the real line , 1962 .

[4] Peter L. Hammer,et al. Difference graphs , 1990, Discret. Appl. Math..

[5] Hiroshi Maehara,et al. Space graphs and sphericity , 1984, Discret. Appl. Math..

[6] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..