Minimum graphs with complete k-closure (Q1146691): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 09:52, 13 June 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
