Independent Transversal Dominating Sets in Graphs: Complexity and Structural Properties
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Ismael González Yero,et al. Coloring, location and domination of corona graphs , 2012 .
[3] F. Harary,et al. On the corona of two graphs , 1970 .
[4] Ismail Sahul Hamid,et al. Independent transversal domination in graphs , 2012, Discuss. Math. Graph Theory.
[5] Michael R. Fellows. Transversals of Vertex Partitions in Graphs , 1990, SIAM J. Discret. Math..
[6] Vadim E. Levit,et al. Combinatorial properties of the family of maximum stable sets of a graph , 2002, Discret. Appl. Math..
[7] Noga Alon,et al. Vertex transversals that dominate , 1996, J. Graph Theory.
[8] Boros Edre,et al. On the number of vertices belonging to all maximum stable sets of a graph , 1999 .
[9] Zsolt Tuza,et al. Covering the cliques of a graph with vertices , 1992, Discret. Math..
[10] Endre Boros,et al. On the number of vertices belonging to all maximum stable sets of a graph , 2002, Discret. Appl. Math..
[11] Noga Alon. The String Chromatic Number of a Graph , 1992, Random Struct. Algorithms.