A note on the computation on the k-closure of a graph (Q1108040): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A method in graph theory / 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: Q4057549 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5625199 / 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 |
Latest revision as of 18:46, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on the computation on the k-closure of a graph |
scientific article |
Statements
A note on the computation on the k-closure of a graph (English)
0 references
1987
0 references
Hamilton cycles
0 references
closure of graph
0 references
0 references