Some observations on the determination of an upper bound for the clique number of a graph (Q1220089): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Enumeration of Maximal Cliques of Large Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Upper Bounds on the Order of a Clique of a Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5615282 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems / rank | |||
Normal rank | |||
Latest revision as of 17:19, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some observations on the determination of an upper bound for the clique number of a graph |
scientific article |
Statements
Some observations on the determination of an upper bound for the clique number of a graph (English)
0 references
1975
0 references
