Proof of a conjecture about minimum spanning tree cycle intersection (Q2172386): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q113877179, #quickstatements; #temporary_batch_1711031506070 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Minimum spanning tree cycle intersection problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the History of the Minimum Spanning Tree Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimum Communication Spanning Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of the network design problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Spanning Trees and Optimization Problems / rank | |||
Normal rank |
Latest revision as of 03:05, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Proof of a conjecture about minimum spanning tree cycle intersection |
scientific article |
Statements
Proof of a conjecture about minimum spanning tree cycle intersection (English)
0 references
15 September 2022
0 references
spanning tree
0 references
cycle
0 references