On maximally distant spanning trees of a graph (Q1229218): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5668821 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum partition of a matroid into independent subsets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Solution of the Shannon Switching Game / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decomposition of Finite Graphs Into Forests / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank | |||
Normal rank |
Revision as of 19:25, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On maximally distant spanning trees of a graph |
scientific article |
Statements
On maximally distant spanning trees of a graph (English)
0 references
1976
0 references