Competitively tight graphs (Q2441380): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
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: Competition numbers of graphs with a small number of triangles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3838404 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The competition number of a graph and the dimension of its hole space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The competition number of the complement of a cycle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Competition Numbers, Quasi-line Graphs, and Holes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A generalization of Opsut's lower bounds for the competition number of a graph / rank | |||
Normal rank |
Revision as of 11:52, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Competitively tight graphs |
scientific article |
Statements
Competitively tight graphs (English)
0 references
24 March 2014
0 references
competition graph
0 references
competition number
0 references
edge clique cover
0 references
upper bound
0 references
competitively tight
0 references