On the shape of decomposable trees (Q1043555): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Decomposable trees: A polynomial algorithm for tripodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree bound on decomposable trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Plane triangulations are 6-partitionable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line arbitrarily vertex decomposable trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5481324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homology theory for spanning tress of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for four-partitioning four-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for bipartition of biconnected graphs / rank
 
Normal rank

Latest revision as of 06:14, 2 July 2024

scientific article
Language Label Description Also known as
English
On the shape of decomposable trees
scientific article

    Statements

    On the shape of decomposable trees (English)
    0 references
    0 references
    0 references
    0 references
    9 December 2009
    0 references
    tree partitions
    0 references
    arbitrarily partitionable trees
    0 references
    homeomorphism class
    0 references
    integer partitions
    0 references

    Identifiers