Spanning trees with pairwise nonadjacent endvertices (Q1363666): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4187840 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5782525 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Randomly Traceable Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The forest plus stars colouring problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs in which every path is contained in a Hamilton path. / rank | |||
Normal rank |
Latest revision as of 17:10, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Spanning trees with pairwise nonadjacent endvertices |
scientific article |
Statements
Spanning trees with pairwise nonadjacent endvertices (English)
0 references
10 August 1997
0 references
depth-first-search tree
0 references
spanning tree
0 references
connected graph
0 references
independency tree
0 references
endvertices
0 references