A characterization of competition graphs of arbitrary digraphs

DOI10.1016/0166-218X(83)90087-2zbMath0521.05059OpenAlexW1987387008MaRDI QIDQ1055445

Jeffrey E. Steif, Fred S. Roberts

Publication date: 1983

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(83)90087-2

zbMATH Keywords

complete subgraphscompetition graphsisolated verticescompetition relation

Mathematics Subject Classification ID

Ecology (92D40) Graph theory (05C99)

Related Items (18)

The competition-common enemy graph of a digraph ⋮ Competition hypergraphs ⋮ Two-\(\phi\)-tolerance competition graphs ⋮ A generalization of Opsut's lower bounds for the competition number of a graph ⋮ Competition numbers of graphs with a small number of triangles ⋮ Niche graphs ⋮ Competition graphs of degree bounded digraphs ⋮ \((i,j)\) competition graphs ⋮ Characterizations of competition multigraphs ⋮ A class of acyclic digraphs with interval competition graphs ⋮ Loop and cyclic niche graphs ⋮ Tolerance competition graphs ⋮ \(p\)-competition graphs ⋮ Phylogeny numbers ⋮ Applications of edge coverings by cliques ⋮ Competition polysemy ⋮ A characterization of competition graphs ⋮ A characterization of graphs of competition number m

Cites Work

• A characterization of competition graphs
• A characterization of graphs of competition number m
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• On the Computation of the Competition Number of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A characterization of competition graphs of arbitrary digraphs