New bounds for the clique number of a graph (Q1254255): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(78)90061-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2013986054 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some observations on the determination of an upper bound for the clique number of a graph / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:25, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New bounds for the clique number of a graph |
scientific article |
Statements
New bounds for the clique number of a graph (English)
0 references
1978
0 references
Bounds for the Clique Number of a Graph
0 references
Np-Complete Problems
0 references
