Transforming spanning trees: A lower bound (Q1028225): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Transforming spanning trees and pseudo-triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences of spanning trees and a fixed tree theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compatible Geometric Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic distance bound on sliding between crossing-free spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the number of crossing-free subgraphs of \(K_N\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric tree graphs of points in convex position / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of non-crossing perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of triangulations and perfect matchings / rank
 
Normal rank

Revision as of 17:08, 1 July 2024

scientific article
Language Label Description Also known as
English
Transforming spanning trees: A lower bound
scientific article

    Statements

    Identifiers