On-line arbitrarily vertex decomposable suns (Q1045163): 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: Arbitrarily vertex decomposable caterpillars with four or five leaves / 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: Q5443779 / rank
 
Normal rank

Latest revision as of 07:56, 2 July 2024

scientific article
Language Label Description Also known as
English
On-line arbitrarily vertex decomposable suns
scientific article

    Statements

    On-line arbitrarily vertex decomposable suns (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    0 references
    arbitrary partition (vertex decomposition) of graphs
    0 references
    partition on-line
    0 references
    0 references