Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5920195): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W3023857005 / rank
 
Normal rank

Revision as of 01:07, 20 March 2024

scientific article; zbMATH DE number 7057339
Language Label Description Also known as
English
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
scientific article; zbMATH DE number 7057339

    Statements

    Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 May 2019
    0 references
    graph square root
    0 references
    outerplanar graphs
    0 references
    graphs of pathwidth 2
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references