\((i,j)\) competition graphs
From MaRDI portal
Publication:1179189
DOI10.1016/0166-218X(91)90002-EzbMath0746.05028WikidataQ127909409 ScholiaQ127909409MaRDI QIDQ1179189
J. Richard Lundgren, Kim A. S. Hefner, Suh-Ryung Kim, Fred S. Roberts, Kathryn Fraughnaugh Jones
Publication date: 26 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Structural characterization of families of graphs (05C75) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)
Related Items (10)
Two-\(\phi\)-tolerance competition graphs ⋮ On the phylogeny graphs of degree-bounded digraphs ⋮ On CCE graphs of doubly partial orders ⋮ The (1,2)-step competition graph of a tournament ⋮ Competition graphs of degree bounded digraphs ⋮ A class of acyclic digraphs with interval competition graphs ⋮ Tolerance competition graphs ⋮ \(p\)-competition graphs ⋮ A characterization of graphs with interval two-step graphs ⋮ Chromatic numbers of competition graphs
Cites Work
- Some recent results on niche graphs
- The double competition number of some triangle-free graphs
- Applications of edge coverings by cliques
- A characterization of competition graphs
- A characterization of graphs of competition number m
- A characterization of competition graphs of arbitrary digraphs
- The competition-common enemy graph of a digraph
- Niche graphs
- Betweenness, orders and interval graphs
- Trophic links of community food webs.
- Algorithmic Aspects of Vertex Elimination on Graphs
- On the Computation of the Competition Number of a Graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \((i,j)\) competition graphs