A characterization of competition graphs of arbitrary digraphs
From MaRDI portal
Publication:1055445
DOI10.1016/0166-218X(83)90087-2zbMATH Open0521.05059OpenAlexW1987387008MaRDI QIDQ1055445FDOQ1055445
Authors: Fred Roberts, Jeffrey E. Steif 
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
Cites Work
- A characterization of competition graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A characterization of graphs of competition number m
- On the Computation of the Competition Number of a Graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
Cited In (18)
- Competition numbers of graphs with a small number of triangles
- A characterization of competition graphs
- Competition graphs of degree bounded digraphs
- A class of acyclic digraphs with interval competition graphs
- Competition polysemy
- \((i,j)\) competition graphs
- The competition-common enemy graph of a digraph
- Niche graphs
- A generalization of Opsut's lower bounds for the competition number of a graph
- Characterizations of competition multigraphs
- Phylogeny numbers
- \(p\)-competition graphs
- Loop and cyclic niche graphs
- Tolerance competition graphs
- Competition hypergraphs
- Applications of edge coverings by cliques
- Two-\(\phi\)-tolerance competition graphs
- A characterization of graphs of competition number m
This page was built for publication: A characterization of competition graphs of arbitrary digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1055445)
