Minimum graphs with complete k-closure (Q1146691): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: A method in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Hamilton's ideals / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some Theorems on Abstract Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Note on Hamilton Circuits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5722819 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(80)90110-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1978165383 / rank | |||
Normal rank | |||
Latest revision as of 08:29, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum graphs with complete k-closure |
scientific article |
Statements
Minimum graphs with complete k-closure (English)
0 references
1980
0 references
k-closure of a graph
0 references
minimum number of edges
0 references
