Farber, Martin; Hahn, Geňa; Hell, Pavol; Miller, Donald Concerning the achromatic number of graphs. (English) Zbl 0577.05032 J. Comb. Theory, Ser. B 40, 21-39 (1986). See the preview in Zbl 0554.05028. Cited in 1 ReviewCited in 16 Documents MSC: 05C15 Coloring of graphs and hypergraphs 05C35 Extremal problems in graph theory 68R10 Graph theory (including graph drawing) in computer science 68Q25 Analysis of algorithms and problem complexity Keywords:achromatic number; computational complexity; NP-completeness; bipartite graphs; polynomial algorithms; trees; upper bounds Citations:Zbl 0554.05028 PDFBibTeX XMLCite \textit{M. Farber} et al., J. Comb. Theory, Ser. B 40, 21--39 (1986; Zbl 0577.05032) Full Text: DOI References: [1] Aho, A. V.; Hopcroft, J. E.; Ullman, J. D., (The Design and Analysis of Computer Algorithms (1974), Addison-Wesley: Addison-Wesley Reading, Mass) · Zbl 0326.68005 [2] Garey, M. R.; Johnson, D. S., (Computers and Intractability: A Guide to the Theory of NP-completeness (1979), Freeman: Freeman San Francisco) · Zbl 0411.68039 [3] Gavril, F., Algorithms for minimum covering, maximum clique, minimum covering by cliques and maximum independent set of a chordal graph, SIAM J. Comput., 1, 180-187 (1972) · Zbl 0227.05116 [4] Harary, F.; Hedetniemi, S.; Prins, G., An interpolation theorem for graphical homomorphisms, Portugal Math., 26, 453-462 (1967) · Zbl 0187.20903 [5] Hedrlin, Z.; Hell, P.; Ko, C. S., Homomorphism interpolation and approximation, Ann. Discrete Math., 15, 213-227 (1982) · Zbl 0496.05060 [6] Hell, P.; Miller, D. J., Graphs with forbidden homomorphic images, Ann. N. Y. Acad. Sci., 319, 270-280 (1979) · Zbl 0483.05030 [7] Hell, P.; Miller, D. J., Graphs with given achromatic number, Discrete Math., 16, 195-207 (1976) · Zbl 0345.05113 [8] Hoffman, A., Eigenvalues and partitionings of the edges of a graph, Linear Algebra Appl., 5, 137-146 (1972) · Zbl 0247.05125 [9] Hopcroft, J.; Karp, R., An \(n^{52}\) algorithm for maximum matchings in bipartite graphs, SIAM J. Comput., 2, No. 4, 225-231 (1973) · Zbl 0266.05114 [10] Lopez-Bracho, R., Étude du nombre achromatique des étoiles, (these (1981), Université de Paris-Sud) · Zbl 0568.05027 [11] Maurer, H. A.; Sudborough, J. H.; Welzl, E., On the complexity of the general coloring problem, Inform. and Control, 51, 128-145 (1981) · Zbl 0502.68015 [12] Máté, A., A lower estimate for the achromatic number of irreducible graphs, Discrete Math., 33, No. 2, 171-183 (1981) · Zbl 0454.05027 [13] Matula, D. W., Subtree isomorphisms in \(O(n^{52})\), (Alspach, B.; Hell, P.; Miller, D. J., Algorithmic Aspects of Combinatorics. Algorithmic Aspects of Combinatorics, Ann. Discrete Math., Vol. 2 (1978), North-Holland: North-Holland Amsterdam/New York), 91-106 · Zbl 0391.05022 [14] Papadimitriou, C. H.; Steiglitz, K., (Combinatorial Optimization: Algorithms and Complexity (1982), Prentice-Hall: Prentice-Hall Englewood Cliffs, N.J) · Zbl 0503.90060 [15] Yannakakis, M.; Gavril, F., Edge dominating sets in graphs, SIAM J. Appl. Math., 38, No. 3, 364-372 (1980) · Zbl 0455.05047 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.