Cutting a graph into two dissimilar halves (Q3801597)

From MaRDI portal
Revision as of 18:02, 18 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Cutting a graph into two dissimilar halves
scientific article

    Statements

    title
    Cutting a graph into two dissimilar halves (English)
    0 references
    author
    Mark K. Goldberg
    0 references
    János Pach
    0 references
    Paul Erdős
    0 references
    J. H. Spencer
    0 references
    publication date
    1988
    0 references
    zbMATH Keywords
    discrepancy
    0 references
    numbers of the edges
    0 references

    Identifiers

    zbMATH DE Number
    4068932
    0 references
    OpenAlex ID
    W1969292476
    0 references
    Wikidata QID
    Q105889473
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3801597&oldid=34792225"
    Powered by MediaWiki