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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Operations Which Preserve Path-Width at Most Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of graphs with path-width at most two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing square roots of graphs with low maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for finding square roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding cut-vertices in the square roots of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of finding graph roots with girth conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square root of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recognition of threshold tolerance graphs and their complements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding cactus roots in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear kernel for finding square roots of almost planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obstruction set isolation for the gate matrix layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite roots of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Powers of Proper Interval, Split, and Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to recognize squares of split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square of a block graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A good characterization of squares of strongly chordal split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Square Roots of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of line graphs that are squares of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing square roots of trivially perfect and threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing roots of graphs is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square root of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Square roots of minor closed graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of outerplanar graphs / rank
 
Normal rank

Revision as of 07:31, 19 July 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
    0 references
    0 references
    0 references
    0 references

    Identifiers

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