Finding cactus roots in polynomial time (Q726100): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59603573, #quickstatements; #temporary_batch_1711055989931
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Uniqueness of graph square roots of girth six / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths / 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: 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: Graph minors. XVI: Excluding a non-planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374865 / 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: The square of a block 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: Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 / 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: Squares of low clique number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A criterion for planarity of the square of a graph / 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: 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

Latest revision as of 06:43, 16 July 2024

scientific article
Language Label Description Also known as
English
Finding cactus roots in polynomial time
scientific article

    Statements

    Finding cactus roots in polynomial time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 August 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    square root
    0 references
    cactus
    0 references
    treewidth
    0 references
    clique number
    0 references
    0 references
    0 references
    0 references