Finding cut-vertices in the square roots of a graph (Q5915963): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128943652, #quickstatements; #temporary_batch_1723710233280
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Uniqueness of graph square roots of girth six / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Powers of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game of cops and robbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Organizing the atoms of the clique separator decomposition into an atom tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing width two for variants of treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Distance Coloring of Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Minimum Fill-in: Grouping the Minimal Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Tree Root Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(H\)-topological intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for finding square roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Decomposition by Clique Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected cutsets of a graph and triangle bases of the cycle space / 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 of every two-connected graph is Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5341588 / 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: Finding cactus roots in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in circular arc graphs / 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: Minimal triangulations of graphs: a survey / 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: A good characterization of squares of strongly chordal 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: Optimal decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring the square of a \(K_{4}\)-minor free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of cycles, powers of paths, and distance 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: Computing square roots of trivially perfect and threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the chromatic number of the square of a planar graph / 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: Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and algorithmic applications of chordal graph embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the tree representation of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing circular-arc graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128943652 / rank
 
Normal rank

Latest revision as of 09:53, 15 August 2024

scientific article; zbMATH DE number 7034217
Language Label Description Also known as
English
Finding cut-vertices in the square roots of a graph
scientific article; zbMATH DE number 7034217

    Statements

    Finding cut-vertices in the square roots of a graph (English)
    0 references
    0 references
    11 March 2019
    0 references
    square root of a graph
    0 references
    clique-separator decomposition
    0 references
    cut-vertices
    0 references
    cactus-block graphs
    0 references
    cycle-power graphs
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers