Diameter and treewidth in minor-closed graph families, revisited (Q1762990)

From MaRDI portal
Revision as of 02:00, 22 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q29031208, #quickstatements; #temporary_batch_1708557319324)
scientific article
Language Label Description Also known as
English
Diameter and treewidth in minor-closed graph families, revisited
scientific article

    Statements

    title
    Diameter and treewidth in minor-closed graph families, revisited (English)
    0 references
    published in
    Algorithmica
    0 references
    publication date
    11 February 2005
    0 references
    zbMATH Keywords
    Apex graphs
    0 references
    Graph minors
    0 references
    Bounded local treewidth
    0 references
    Graph algorithms
    0 references
    Approximation algorithms
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C85
    0 references
    05C12
    0 references
    68R10
    0 references
    zbMATH DE Number
    2133724
    0 references
    Wikidata QID
    Q29031208
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1762990&oldid=22367589"
    Powered by MediaWiki