Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings (Q3439389)

From MaRDI portal
Revision as of 11:16, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings
scientific article

    Statements

    Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings (English)
    0 references
    0 references
    0 references
    29 May 2007
    0 references
    matching
    0 references
    colouring
    0 references
    bipartite graphs
    0 references

    Identifiers