Recognition of Unigraphs through Superposition of Graphs

DOI10.7155/jgaa.00229zbMath1276.05111OpenAlexW2071080814MaRDI QIDQ2865028

Alessandro Borri, Rossella Petreschi, Tiziana Calamoneri

Publication date: 28 November 2013

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00229

zbMATH Keywords

linear time algorithmmatrogenic graphunigraphs recognizing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Win-win kernelization for degree sequence completion problems ⋮ Graph isomorphism, color refinement, and compactness ⋮ \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs ⋮ Hereditary unigraphs and Erdős-Gallai equalities ⋮ On the Power of Color Refinement ⋮ On 2-switches and isomorphism classes

This page was built for publication: Recognition of Unigraphs through Superposition of Graphs