A characterization of competition graphs of arbitrary digraphs
- 30 September 1983
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 6 (3) , 323-326
- https://doi.org/10.1016/0166-218x(83)90087-2
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A characterization of graphs of competition number mDiscrete Applied Mathematics, 1983
- A characterization of competition graphsDiscrete Applied Mathematics, 1983
- On the Computation of the Competition Number of a GraphSIAM Journal on Algebraic Discrete Methods, 1982
- Frequency assignment: Theory and applicationsProceedings of the IEEE, 1980
- Covering edges by cliques with regard to keyword conflicts and intersection graphsCommunications of the ACM, 1978
- Food webs and the dimensionality of trophic niche spaceProceedings of the National Academy of Sciences, 1977
- Contentment in graph theory: Covering graphs with cliquesIndagationes Mathematicae, 1977
- The zero error capacity of a noisy channelIEEE Transactions on Information Theory, 1956