Conditions for graphs to be path partition optimal (Q1709536)

From MaRDI portal
Revision as of 05:13, 11 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
Conditions for graphs to be path partition optimal
scientific article

    Statements

    title
    Conditions for graphs to be path partition optimal (English)
    0 references
    publication date
    5 April 2018
    0 references
    zbMATH Keywords
    path partition number
    0 references
    separable degree
    0 references
    path partition optimal
    0 references
    forbidden subgraph
    0 references
    heavy subgraph
    0 references
    heft index
    0 references
    author
    Bin Long Li
    0 references
    Hajo J. Broersma
    0 references
    Sheng Gui Zhang
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C45
    0 references
    05C38
    0 references
    05C70
    0 references
    05C35
    0 references
    05C40
    0 references
    zbMATH DE Number
    6856465
    0 references
    OpenAlex ID
    W2793133492
    0 references
    Wikidata QID
    Q130194299
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1709536&oldid=38710157"
    Powered by MediaWiki