Maximum cuts and judicious partitions in graphs without short cycles (Q1400968)

From MaRDI portal
Revision as of 15:11, 20 July 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
Maximum cuts and judicious partitions in graphs without short cycles
scientific article

    Statements

    Maximum cuts and judicious partitions in graphs without short cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 August 2003
    0 references
    bipartite cut problem
    0 references

    Identifiers