Monma, Clyde L.; Wei, Victor K. Intersection graphs of paths in a tree. (English) Zbl 0682.05028 Combinatorics, graph theory and computing, Proc. 16th Southeast. Conf., Boca Raton/Fla. 1985, Congr. Numerantium 49, 57-74 (1985). Reviewer: A.Tucker MSC: 05C05 PDFBibTeX XML
Jones, Kathryn F.; Lundgren, J. Richard; Maybee, John S. Clique covers of digraphs. II. (English) Zbl 0677.05037 Combinatorics, graph theory and computing, Proc. 16th Southeast. Conf., Boca Raton/Fla. 1985, Congr. Numerantium 48, 211-218 (1985). MSC: 05C20 05C35 05C70 PDFBibTeX XML
Kostochka, A. V. On the number of graph edges not contained in common cliques. (English) Zbl 0657.05038 Graphs, hypergraphs and applications, Proc. Conf. Graph Theory, Eyba/GDR 1984, Teubner-Texte Math. 73, 110-114 (1985). MSC: 05C35 05C30 PDFBibTeX XML
Grimaldi, Ralph P. Properties of integer-interval graphs. (English) Zbl 0646.05054 Combinatorics, graph theory and computing, Proc. 16th Southeast. Conf., Boca Raton/Fla. 1985, Congr. Numerantium 48, 145-151 (1985). MSC: 05C75 PDFBibTeX XML
Gionfriddo, Mario; Vanstone, Scott A. On \(L_ 2\)-colourings of a graph. (English) Zbl 0609.05036 J. Inf. Optim. Sci. 6, 243-246 (1985). Reviewer: C.McDiarmid MSC: 05C15 PDFBibTeX XMLCite \textit{M. Gionfriddo} and \textit{S. A. Vanstone}, J. Inf. Optim. Sci. 6, 243--246 (1985; Zbl 0609.05036) Full Text: DOI
Kostochka, A. V. Maximum set of edges no two covered by a clique. (English) Zbl 0606.05033 Combinatorica 5, 229-235 (1985). Reviewer: B.Andrásfai MSC: 05C35 05C15 PDFBibTeX XMLCite \textit{A. V. Kostochka}, Combinatorica 5, 229--235 (1985; Zbl 0606.05033) Full Text: DOI
Wilf, Herbert S. Graphs and their spectra: Old and new results. (English) Zbl 0598.05048 Proc. Conf., Sundance/Utah 1985, Congr. Numerantium 50, 37-42 (1985). Reviewer: B.McKay MSC: 05C50 05C38 15A18 PDFBibTeX XML
Stencel, Marek Theorems of Nordhaus-Gaddum type for some numbers. (English) Zbl 0596.05025 Discuss. Math. 7, 107-112 (1985). Reviewer: J.Fiamčík MSC: 05C15 PDFBibTeX XMLCite \textit{M. Stencel}, Discuss. Math. 7, 107--112 (1985; Zbl 0596.05025)
Brandstädt, Andreas; Kratsch, Dieter On domination problems for permutation and other graphs. (English) Zbl 0588.05047 Forschungsergeb., Friedrich-Schiller-Univ. Jena N/85/41, 24 p. (1985). Reviewer: R.Bodendiek MSC: 05C99 68R10 PDFBibTeX XML
Corneil, D. G. The complexity of generalized clique packing. (English) Zbl 0588.05037 Discrete Appl. Math. 12, 233-239 (1985). Reviewer: L.Niepel MSC: 05C70 05C35 68Q25 68R10 PDFBibTeX XMLCite \textit{D. G. Corneil}, Discrete Appl. Math. 12, 233--239 (1985; Zbl 0588.05037) Full Text: DOI
Späth, Helmuth Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs. (English) Zbl 0581.90092 Z. Oper. Res., Ser. A 29, 125-131 (1985). Reviewer: Tian Feng MSC: 90C35 65K05 PDFBibTeX XMLCite \textit{H. Späth}, Z. Oper. Res., Ser. A 29, 125--131 (1985; Zbl 0581.90092) Full Text: DOI
Corneil, D. G.; Perl, Y.; Stewart, L. K. A linear recognition algorithm for cographs. (English) Zbl 0575.68065 SIAM J. Comput. 14, 926-934 (1985). MSC: 68R10 PDFBibTeX XMLCite \textit{D. G. Corneil} et al., SIAM J. Comput. 14, 926--934 (1985; Zbl 0575.68065) Full Text: DOI
Bender, E. A.; Richmond, L. B.; Wormald, N. C. Almost all chordal graphs split. (English) Zbl 0571.05026 J. Aust. Math. Soc., Ser. A 38, 214-221 (1985). Reviewer: S.Stahl MSC: 05C30 05C38 05C80 PDFBibTeX XMLCite \textit{E. A. Bender} et al., J. Aust. Math. Soc., Ser. A 38, 214--221 (1985; Zbl 0571.05026)
Hedman, Bruce The maximum number of cliques in dense graphs. (English) Zbl 0569.05029 Discrete Math. 54, 161-166 (1985). MSC: 05C35 PDFBibTeX XMLCite \textit{B. Hedman}, Discrete Math. 54, 161--166 (1985; Zbl 0569.05029) Full Text: DOI
Gyárfás, A.; Lehel, J. Covering and coloring problems for relatives of intervals. (English) Zbl 0569.05020 Discrete Math. 55, 167-180 (1985). Reviewer: I.Tomescu MSC: 05C15 05B40 PDFBibTeX XMLCite \textit{A. Gyárfás} and \textit{J. Lehel}, Discrete Math. 55, 167--180 (1985; Zbl 0569.05020) Full Text: DOI
Gyárfás, A. On the chromatic number of multiple interval graphs and overlap graphs. (English) Zbl 0569.05019 Discrete Math. 55, 161-166 (1985). Reviewer: I.Tomescu MSC: 05C15 PDFBibTeX XMLCite \textit{A. Gyárfás}, Discrete Math. 55, 161--166 (1985; Zbl 0569.05019) Full Text: DOI
Bertossi, Alan A.; Bonuccelli, Maurizio A. Some parallel algorithms on interval graphs. (English) Zbl 0559.68060 VLSI: Algorithms and architectures, Proc. Int. Workshop Parallel Comput. VLSI, Amalfi/Italy 1984, 69-78 (1985). MSC: 68R10 68Q25 PDFBibTeX XML