Max-cut and extendability of matchings in distance-regular graphs (Q518196)

From MaRDI portal
Revision as of 20:13, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Max-cut and extendability of matchings in distance-regular graphs
scientific article

    Statements

    title
    Max-cut and extendability of matchings in distance-regular graphs (English)
    0 references
    author
    Sebastian M. Cioabă
    0 references
    Jack H. Koolen
    0 references
    Weiqiang Li
    0 references
    publication date
    28 March 2017
    0 references
    zbMATH Keywords
    \(t\)-extendable connected graph
    0 references
    cites work
    Q3127430
    0 references
    Q3992965
    0 references
    Spectra of graphs
    0 references
    Q4198056
    0 references
    Equiarboreal graphs
    0 references
    Q2716030
    0 references
    Q4033701
    0 references
    Q4276003
    0 references
    Q3395507
    0 references
    Q4352274
    0 references
    Q5202209
    0 references
    Q5659595
    0 references
    On n-extendable graphs
    0 references
    Q4876750
    0 references
    Q2755077
    0 references
    Q5287862
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C12
    0 references
    05C40
    0 references
    05C70
    0 references
    zbMATH DE Number
    6697641
    0 references
    OpenAlex ID
    W1432662476
    0 references
    arXiv ID
    1507.06254
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q518196&oldid=38384927"
    Powered by MediaWiki