Recognition of unigraphs through superposition of graphs

DOI10.7155/JGAA.00229zbMATH Open1276.05111OpenAlexW2071080814MaRDI QIDQ2865028FDOQ2865028

Authors: 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

Recommendations

• Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)
• Decomposition of graphical sequences and unigraphs
• Characterization of hereditary unigraphs based on canonical decomposition
• scientific article; zbMATH DE number 3896983
• Hereditary unigraphs and Erdős-Gallai equalities

zbMATH Keywords

linear time algorithmmatrogenic graphunigraphs recognizing

Mathematics Subject Classification ID

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

Cited In (9)

• Recognition of overlap graphs
• Win-win kernelization for degree sequence completion problems
• Characterization of hereditary unigraphs based on canonical decomposition
• Hereditary unigraphs and Erdős-Gallai equalities
• Graph isomorphism, color refinement, and compactness
• On the power of color refinement
• Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)
• \(H\)-product of graphs, \(H\)-threshold graphs and threshold-width of graphs
• On 2-switches and isomorphism classes

This page was built for publication: Recognition of unigraphs through superposition of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2865028)