Harmonious Coloring on Subclasses of Colinear Graphs
暂无分享,去创建一个
[1] P. Hammer,et al. Aggregation of inequalities in integer programming. , 1975 .
[2] Fanica Gavril,et al. A recognition algorithm for the intersection graphs of paths in trees , 1978, Discret. Math..
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .
[5] B. Bollobás. Surveys in Combinatorics , 1979 .
[6] M. Golumbic. CHAPTER 3 – Perfect Graphs , 1980 .
[7] Mihalis Yannakakis,et al. Edge Dominating Sets in Graphs , 1980 .
[8] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[9] Martin Farber,et al. Characterizations of strongly chordal graphs , 1983, Discret. Math..
[10] Martin Farber,et al. Domination, independent domination, and duality in strongly chordal graphs , 1984, Discret. Appl. Math..
[11] Clyde L. Monma,et al. Intersection graphs of paths in a tree , 1986, J. Comb. Theory, Ser. B.
[12] F. McMorris,et al. Topics in Intersection Graph Theory , 1987 .
[13] A. Brandstädt,et al. Graph Classes: A Survey , 1987 .
[14] Gerard J. Chang. Labeling algorithms for domination problems in sun-free chordal graphs , 1988, Discret. Appl. Math..
[15] Hans L. Bodlaender,et al. Achromatic Number is NP-Complete for Cographs and Interval Graphs , 1989, Inf. Process. Lett..
[16] Dieter Kratsch,et al. Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs , 1991, Discret. Math..
[17] Alejandro A. Schäffer,et al. A Faster Algorithm to Recognize Undirected Path Graphs , 1993, Discret. Appl. Math..
[18] Colin McDiarmid,et al. The Complexity of Harmonious Colouring for Trees , 1995, Discret. Appl. Math..
[19] Keith Edwards,et al. The harmonious chromatic number and the achromatic number , 1997 .
[20] Keith Edwards,et al. Some results on the achromatic number , 1997 .
[21] M. Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .
[22] Katerina Asdre,et al. NP-completeness results for some problems on subclasses of bipartite and chordal graphs , 2007, Theor. Comput. Sci..
[23] Katerina Asdre,et al. The harmonious coloring problem is NP-complete for interval and permutation graphs , 2007, Discret. Appl. Math..
[24] Yusuf Civan,et al. Linear colorings of simplicial complexes and collapsing , 2006, J. Comb. Theory, Ser. A.
[25] Stavros D. Nikolopoulos,et al. Colinear Coloring and Colinear Graphs ∗ , 2009 .
[26] Stavros D. Nikolopoulos,et al. Colinear Coloring on Graphs , 2009, WALCOM.