Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs (Q3439309): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3781792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint subsets of integers having a constant sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5510192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on path-perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Bipartite Graphs Into Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4853740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5749321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4374716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3792719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the ascending subgraph decomposition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ascending star subgraphs decomposition of star forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3919751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Partitioning {1, 2, � , n} into Subsets having Equal Sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4186364 / rank
 
Normal rank

Latest revision as of 20:08, 25 June 2024

scientific article
Language Label Description Also known as
English
Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs
scientific article

    Statements

    Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs (English)
    0 references
    0 references
    0 references
    29 May 2007
    0 references
    0 references
    complete bipartite graph
    0 references
    edge disjoint decomposition
    0 references
    path
    0 references
    partition
    0 references
    0 references