论文信息 - Dominating cliques in graphs - 字舞流文

Dominating cliques in graphs

Margaret B. Cozzens | Laura L. Kelleher

[1] E. S. Wolk. The comparability graph of a tree , 1962 .

[2] E. S. Wolk. A note on “The comparability graph of a tree” , 1965 .

[3] Frank Harary,et al. Graph Theory , 2016 .

[4] Stephen T. Hedetniemi,et al. A Linear Algorithm for the Domination Number of a Tree , 1975, Inf. Process. Lett..

[5] Stephen T. Hedetniemi,et al. Towards a theory of domination in graphs , 1977, Networks.

[6] Lee J. White,et al. Optimum Domination in Weighted Trees , 1978, Inf. Process. Lett..

[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8] T. Ibaraki,et al. Sufficient Conditions for Graphs to Have Threshold Number 2 , 1981 .

[9] M. Yannakakis. The Complexity of the Partial Order Dimension Problem , 1982 .

[10] Kellogg S. Booth,et al. Dominating Sets in Chordal Graphs , 1982, SIAM J. Comput..

[11] Alan A. Bertossi,et al. Dominating Sets for Split and Bipartite Graphs , 1984, Inf. Process. Lett..

[12] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .

[13] Margaret B. Cozzens,et al. Dominating sets in social network graphs , 1988 .