Randomly \(P_k\)-decomposable graphs (Q713169): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graphs that are randomly packable by some common disconnected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3035337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random packings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All \(P_{3}\)-equipackable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248910 / rank
 
Normal rank

Latest revision as of 20:07, 5 July 2024

scientific article
Language Label Description Also known as
English
Randomly \(P_k\)-decomposable graphs
scientific article

    Statements

    Randomly \(P_k\)-decomposable graphs (English)
    0 references
    0 references
    0 references
    26 October 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    randomly decomposable
    0 references
    path
    0 references
    0 references