Distance in graphs (05C12) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)
Recommendations
Cited in
(24)- Closest 4-leaf power is fixed-parameter tractable
- Computing roots of graphs is hard
- Maximizing the strong triadic closure in split graphs and proper interval graphs
- Linear-time algorithms for tree root problems
- A linear kernel for finding square roots of almost planar graphs
- Computing square roots of graphs with low maximum degree
- Complexity of finding graph roots with girth conditions
- Computing square roots of trivially perfect and threshold graphs
- Parameterized algorithms for finding square roots
- Finding cactus roots in polynomial time
- A unified approach to recognize squares of split graphs
- A characterization of line graphs that are squares of graphs
- On the square coloring of comparability graphs
- Constrained representations of map graphs and half-squares
- Maximizing the strong triadic closure in split graphs and proper interval graphs
- scientific article; zbMATH DE number 6469239 (Why is no real title available?)
- scientific article; zbMATH DE number 7324127 (Why is no real title available?)
- Finding cut-vertices in the square roots of a graph
- Graph square roots of small distance from degree one graphs
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
- Characterizing and recognizing exact-distance squares of graphs
- Finding cactus roots in polynomial time
- Parameterized leaf power recognition via embedding into graph products
- The square of a block graph
This page was built for publication: Bipartite roots of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944512)
