A characterization of competition graphs of arbitrary digraphs (Q1055445): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3322121 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of competition graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Covering edges by cliques with regard to keyword conflicts and intersection graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of graphs of competition number m / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Computation of the Competition Number of a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3924236 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4152571 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4171826 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5588433 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0166-218x(83)90087-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1987387008 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:34, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A characterization of competition graphs of arbitrary digraphs |
scientific article |
Statements
A characterization of competition graphs of arbitrary digraphs (English)
0 references
1983
0 references
competition graphs
0 references
competition relation
0 references
complete subgraphs
0 references
isolated vertices
0 references