The square root of a graph

DOI10.1016/S0021-9800(67)80030-9zbMath0153.26001OpenAlexW2072183163MaRDI QIDQ5534027

No author found.

Publication date: 1967

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0021-9800(67)80030-9

zbMATH Keywords

topology

Related Items (19)

Computing roots of graphs is hard ⋮ A linear kernel for finding square roots of almost planar graphs ⋮ Computing square roots of graphs with low maximum degree ⋮ On balance and consistency preserving 2-path signed graphs ⋮ Complexity of finding graph roots with girth conditions ⋮ A good characterization of squares of strongly chordal split graphs ⋮ The square of a block graph ⋮ Finding cut-vertices in the square roots of a graph ⋮ Finding cactus roots in polynomial time ⋮ Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 ⋮ A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph ⋮ Finding Cactus Roots in Polynomial Time ⋮ Applications of edge coverings by cliques ⋮ Characterization of n-path graphs and of graphs having \(n\)-th root ⋮ A characterization of competition graphs ⋮ Linear-time algorithms for tree root problems ⋮ The square of a chordal graph ⋮ Partial Characterizations of 1‐Perfectly Orientable Graphs ⋮ Parameterized algorithms for finding square roots

This page was built for publication: The square root of a graph