Computing the vertex separation of unicyclic graphs (Q596295)

From MaRDI portal
Revision as of 01:42, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Computing the vertex separation of unicyclic graphs
scientific article

    Statements

    title
    Computing the vertex separation of unicyclic graphs (English)
    0 references
    author
    Sumit K. Garg
    0 references
    publication date
    10 August 2004
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    68W05
    0 references
    05C85
    0 references
    zbMATH DE Number
    2085624
    0 references
    zbMATH Keywords
    Algorithms
    0 references
    Unicyclic graphs
    0 references
    Trees
    0 references
    Vertex separation
    0 references
    Search number
    0 references
    Pathwidth
    0 references
    Linear layouts
    0 references
    Layout extensibility
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q596295&oldid=25668526"
    Powered by MediaWiki