Algorithms for Edge Coloring Bipartite Graphs and Multigraphs (Q3946187)

From MaRDI portal
Revision as of 22:50, 20 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
scientific article

    Statements

    Algorithms for Edge Coloring Bipartite Graphs and Multigraphs (English)
    0 references
    0 references
    0 references
    1982
    0 references
    open shop scheduling
    0 references
    Euler partition
    0 references
    minimum edge colorings
    0 references
    maximum cardinality matching problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references