The square of a block graph
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 4077265 (Why is no real title available?)
- scientific article; zbMATH DE number 165077 (Why is no real title available?)
- scientific article; zbMATH DE number 6027233 (Why is no real title available?)
- A linear time algorithm to list the minimal separators of chordal graphs
- Algorithms for Square Roots of Graphs
- Bipartite roots of graphs
- Computing roots of graphs is hard
- Depth-First Search and Linear Graph Algorithms
- Efficient graph representations
- Interval numbers of powers of block graphs
- Linear-Time Algorithms for Tree Root Problems
- Minimal vertex separators of chordal graphs
- On powers of chordal graphs and their colorings
- Recognizing Powers of Proper Interval, Split, and Chordal Graphs
- Simplicial Powers of Graphs
- Structure and linear-time recognition of 4-leaf powers
- The Two-Triangle Case of the Acquaintance Graph
- The square root of a graph
- Tree Powers
Cited in
(23)- A characterization of line graphs that are squares of graphs
- Parameterized algorithms for finding square roots
- Squares, clique graphs, and chordality
- An observation on block graphs
- A characterization of uniquely representable graphs
- Finding cactus roots in polynomial time
- Finding cactus roots in polynomial time
- Edge ideals of squares of trees
- Finding cut-vertices in the square roots of a graph
- A good characterization of squares of strongly chordal split graphs
- Extremes of Markov random fields on block graphs: max-stable limits and structured Hüsler-Reiss distributions
- Computing square roots of trivially perfect and threshold graphs
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
- Graph square roots of small distance from degree one graphs
- scientific article; zbMATH DE number 1545700 (Why is no real title available?)
- A linear kernel for finding square roots of almost planar graphs
- Computing square roots of graphs with low maximum degree
- On the general position number of the k -th power graphs
- Parameterized leaf power recognition via embedding into graph products
- Induced embeddings into Hamming graphs
- The square of a chordal graph
- Finding cut-vertices in the square roots of a graph
- Max-linear graphical models with heavy-tailed factors on trees of transitive tournaments
This page was built for publication: The square of a block graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q965949)