On minimal arbitrarily partitionable graphs (Q456092): 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 the shape of decomposable trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of arbitrarily partitionable graphs with given connectivity / 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: Q4168622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On arbitrarily vertex decomposable trees / 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: Decomposing trees with large diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for bipartition of biconnected graphs / rank
 
Normal rank

Latest revision as of 20:02, 5 July 2024

scientific article
Language Label Description Also known as
English
On minimal arbitrarily partitionable graphs
scientific article

    Statements

    On minimal arbitrarily partitionable graphs (English)
    0 references
    0 references
    0 references
    0 references
    23 October 2012
    0 references
    0 references
    minimal arbitrarily partitionable graph
    0 references
    arbitrary vertex decomposable graph
    0 references
    interconnection networks
    0 references
    0 references