Computing square roots of trivially perfect and threshold graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4134090 (Why is no real title available?)
- scientific article; zbMATH DE number 3974977 (Why is no real title available?)
- scientific article; zbMATH DE number 3545568 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- A Note on "The Comparability Graph of a Tree"
- A good characterization of squares of strongly chordal split graphs
- A result on the total colouring of powers of cycles
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithmic graph theory and perfect graphs
- Algorithms for Square Roots of Graphs
- Bipartite roots of graphs
- Coloring Powers of Chordal Graphs
- Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\)
- Complement reducible graphs
- Complexity of finding graph roots with girth conditions
- Computing roots of graphs is hard
- Graph Classes: A Survey
- Hamiltonian cycles in the square of a graph
- Hardness Results and Efficient Algorithms for Graph Powers
- Introduction to algorithms
- Large-girth roots of graphs
- List-Coloring Squares of Sparse Subcubic Graphs
- Nowhere-zero 3-flows in squares of graphs
- On a property of the class of n-colorable graphs
- On economical set representations of graphs
- On powers of graphs of bounded NLC-width (clique-width)
- On the fractional intersection number of a graph
- On uniquely intersectable graphs
- Powers of cycles, powers of paths, and distance graphs
- Quasi-threshold graphs
- Queue layouts of graph products and powers
- Recognizing Powers of Proper Interval, Split, and Chordal Graphs
- The Comparability Graph of a Tree
- The NLC-width and clique-width for powers of graphs of bounded tree-width
- The square of a block graph
- Time bounds for selection
- Trivially perfect graphs
- Uniqueness of graph square roots of girth six
Cited in
(17)- A characterization of line graphs that are squares of graphs
- Parameterized algorithms for finding square roots
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Finding cactus roots in polynomial time
- Square roots of minor closed graph classes
- Finding cactus roots in polynomial time
- A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
- A unified approach to recognize squares of split graphs
- Maximizing the strong triadic closure in split graphs and proper interval graphs
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
- Graph square roots of small distance from degree one graphs
- A linear kernel for finding square roots of almost planar graphs
- Computing square roots of graphs with low maximum degree
- Maximizing the strong triadic closure in split graphs and proper interval graphs
- Finding cut-vertices in the square roots of a graph
- Squares of low clique number
- scientific article; zbMATH DE number 6027233 (Why is no real title available?)
This page was built for publication: Computing square roots of trivially perfect and threshold graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446337)
