Some families of arbitrarily vertex decomposable graphs (Q3439380): 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: On-line arbitrarily vertex decomposable trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On arbitrarily vertex decomposable trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5481324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ore-type condition for arbitrarily vertex decomposable graphs / rank
 
Normal rank

Latest revision as of 19:09, 25 June 2024

scientific article
Language Label Description Also known as
English
Some families of arbitrarily vertex decomposable graphs
scientific article

    Statements

    Some families of arbitrarily vertex decomposable graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 May 2007
    0 references
    arbitrary partition (vertex decomposition) of trees
    0 references
    partition on-line
    0 references

    Identifiers