Large-Girth Roots of Graphs

DOI10.1137/100792949zbMath1221.05101OpenAlexW2130957263WikidataQ58203693 ScholiaQ58203693MaRDI QIDQ3013143

Michał Adamaszek, Anna Adamaszek

Publication date: 18 July 2011

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/100792949

zbMATH Keywords

complexityrecognition algorithmsgraph powersgraph roots

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

A characterization of line graphs that are squares of graphs ⋮ Computing square roots of trivially perfect and threshold graphs ⋮ Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs

This page was built for publication: Large-Girth Roots of Graphs