Every graph is contained in a sparsest possible balanced graph (Q3705489)

From MaRDI portal
Revision as of 08:45, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Every graph is contained in a sparsest possible balanced graph
scientific article

    Statements

    title
    Every graph is contained in a sparsest possible balanced graph (English)
    0 references
    publication date
    1985
    0 references
    zbMATH Keywords
    global degree
    0 references
    local degree
    0 references
    balanced graph
    0 references

    Identifiers

    zbMATH DE Number
    3931062
    0 references
    OpenAlex ID
    W2168083933
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3705489&oldid=36942052"
    Powered by MediaWiki