All Graphs with at Most Seven Vertices are Pairwise Compatibility Graphs

Type: Article

Publication Date: 2012-07-18

Citations: 28

DOI: https://doi.org/10.1093/comjnl/bxs087

Abstract

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

Locations

  • arXiv (Cornell University) - View - PDF
  • The Computer Journal - View

Similar Works

Action Title Year Authors
+ Pairwise compatibility graphs 2008 Muhammad Nur Yanhaona
K. S. M. Tozammel Hossain
Md. Saidur Rahman
+ Pairwise Compatibility Graphs 2008 Muhammad Nur Yanhaona
K. S. M. Tozammel Hossain
Md. Saidur Rahman
+ Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs 2015 Konrad K. Dabrowski
Daniël Paulusma
+ PDF Chat New results on pairwise compatibility graphs 2022 Sheikh Azizul Hakim
Bishal Basak Papan
Md. Saidur Rahman
+ RETRACTED: Pancyclic graphs and degree sum and neighborhood union involving distance two 2011 Kewen Zhao
+ THE REGULAR TWO-GRAPH ON 276 VERTICES 1991 J.-M. Goethals
J.J. Seidel
+ Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach 2010 Eyal Loz
Martin Máčaj
Mirka Miller
Jana Šiagiová
Jozef Širáň
Jana Tomanová
+ Graphs and Networks 1996 G. P. Gavrilov
А. А. Сапоженко
+ PDF Chat 207. [X. 4.]. “Graphs” 1906 George H. Bryan
+ All graphs with at most seven vertices are Pairwise Compatibility Graphs 2012 Tiziana Calamoneri
Dario Frascaria
Blerina Sinaimeri
+ All graphs with at most seven vertices are Pairwise Compatibility Graphs 2012 Tiziana Calamoneri
Dario Frascaria
Blerina Sinaimeri
+ Vertex-Disjoint Cycles Containing Specified Vertices in a Bipartite Graph 2016 Shaohua Zhang
Jin Yan
Suyun Jiang
+ Vertex-disjoint cycles containing specified edges in a bipartite graph 2001 Guantao Chen
Hikoe Enomoto
Ken Kawarabayashi
Katsuhiro Ota
Dingjun Lou
Akira Saito
+ Vertex-Disjoint Cycles Containing Specified Vertices in a Graph 2006 Yoshimi Egawa
Ryota Matsubara
+ Graphs with three mutually pseudo-similar vertices 1983 Chris Godsil
William L. Kocay
+ Glossary for Chapter 3 2013
+ Connectivity 2005 Frank von der Kammer
Hanjo Täubig
+ Vertex-Disjoint Cycles Containing Specified Edges 2000 Yoshimi Egawa
Ralph J. Faudree
Ervin Győri
Yoshiyasu Ishigami
R. H. Schelp
Hong Wang
+ Intersections of graphs 2011 Béla Bollobás
Alex Scott
+ PDF Chat Graphs with Dilworth Number Two are Pairwise Compatibility Graphs 2013 Tiziana Calamoneri
Rossella Petreschi