Characterizing Star-PCGs
暂无分享,去创建一个
[1] Hiroshi Nagamochi,et al. Some Reduction Operations to Pairwise Compatibility Graphs , 2018, Inf. Process. Lett..
[2] Tiziana Calamoneri,et al. Pairwise Compatibility Graphs: A Survey , 2016, SIAM Rev..
[3] Md. Iqbal Hossain,et al. A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs , 2016, WALCOM.
[4] Antonio Frangioni,et al. Pairwise Compatibility Graphs of Caterpillars , 2014, Comput. J..
[5] Rossella Petreschi,et al. On pairwise compatibility graphs having Dilworth number two , 2014, Theor. Comput. Sci..
[6] Rossella Petreschi,et al. On the Pairwise Compatibility Property of some Superclasses of Threshold Graphs , 2013, Discret. Math. Algorithms Appl..
[7] M. S. Rahman,et al. Pairwise compatibility graphs revisited , 2013, 2013 International Conference on Informatics, Electronics and Vision (ICIEV).
[8] Stephane Durocher,et al. On graphs that are not PCGs , 2013, Theor. Comput. Sci..
[9] Tiziana Calamoneri,et al. All graphs with at most seven vertices are Pairwise Compatibility Graphs , 2012, Comput. J..
[10] Md. Saidur Rahman,et al. Discovering Pairwise Compatibility Graphs , 2010, Discret. Math. Algorithms Appl..
[11] Md. Saidur Rahman,et al. Pairwise compatibility graphs , 2008, WALCOM.
[12] J. Ian Munro,et al. Efficient Generation of Uniform Samples from Phylogenetic Trees , 2003, WABI.
[13] Zhi-Zhong Chen,et al. Computing phylogenetic roots with bounded degrees and errors is NP-complete , 2001, Theor. Comput. Sci..
[14] Tao Jiang,et al. Phylogenetic k-Root and Steiner k-Root , 2000, ISAAC.
[15] Dimitrios M. Thilikos,et al. On Graph Powers for Leaf-Labeled Trees , 2000, SWAT.
[16] J. Felsenstein. Cases in which Parsimony or Compatibility Methods will be Positively Misleading , 1978 .
[17] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..
[18] Andreas Brandstädt,et al. Leaf powers , 2021 .
[19] Rossella Petreschi,et al. On pairwise compatibility graphs having Dilworth number k , 2014, Theor. Comput. Sci..
[20] Gregory L. McColm,et al. Journal of Graph Algorithms and Applications Generating Geometric Graphs Using Automorphisms , 2012 .
[21] Md. Iqbal Hossain,et al. Journal of Graph Algorithms and Applications Triangle-free Outerplanar 3-graphs Are Pairwise Compatibility Graphs , 2012 .
[22] K. S. M. T. Hossain,et al. Pairwise compatibility graphs , 2009 .
[23] Debajyoti Mondal,et al. Journal of Graph Algorithms and Applications a Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs , 2022 .