Type: Article
Publication Date: 2012-07-18
Citations: 28
DOI: https://doi.org/10.1093/comjnl/bxs087
Journal Article All Graphs with at Most Seven Vertices are Pairwise Compatibility Graphs Get access Tiziana Calamoneri, Tiziana Calamoneri Department of Computer Science, 'Sapienza' University of Rome, Via Salaria 113, 00198 Roma, Italy Search for other works by this author on: Oxford Academic Google Scholar Dario Frascaria, Dario Frascaria Department of Computer Science, 'Sapienza' University of Rome, Via Salaria 113, 00198 Roma, Italy Search for other works by this author on: Oxford Academic Google Scholar Blerina Sinaimeri Blerina Sinaimeri * Department of Computer Science, 'Sapienza' University of Rome, Via Salaria 113, 00198 Roma, Italy *Corresponding author: [email protected] Search for other works by this author on: Oxford Academic Google Scholar The Computer Journal, Volume 56, Issue 7, July 2013, Pages 882–886, https://doi.org/10.1093/comjnl/bxs087 Published: 18 July 2012 Article history Received: 14 March 2012 Revision received: 23 May 2012 Published: 18 July 2012
Action | Title | Year | Authors |
---|---|---|---|
+ PDF Chat | On Relaxing the Constraints in Pairwise Compatibility Graphs | 2012 |
Tiziana Calamoneri Rossella Petreschi Blerina Sinaimeri |