McDiarmid, Colin Colouring random graphs. (English) Zbl 0673.05037 Stochastics and optimization, Sel. Pap. ISSO Meet., Gorguano/Italy 1982, Ann. Oper. Res. 1, 183-200 (1984). MSC: 05C15 05C80 68R10 PDFBibTeX XML
Voss, Heinz-Jürgen Unabhängige Mengen in k-chromatischen Graphen. (Independent sets in k- chromatic graphs). (German) Zbl 0646.05028 Geometrie und Kombinatorik, 2. Kolloq., Karl-Marx-Stadt/DDR 1983, Vortr. 1, 2, Teil II, 199-206 (1984). MSC: 05C15 05C35 PDFBibTeX XML
Schmeichel, Irmgard Automorphismen von Graphen mit zulässiger Kantenfärbung \(\phi\) . (Automorphisms of graphs with admissible edge colouring \(\phi\) ). (German) Zbl 0631.05023 Geometrie und Kombinatorik, 2. Kolloq., Karl-Marx-Stadt/DDR 1983, Vortr. 1, 2, Teil II, 244-246 (1984). MSC: 05C15 05C25 PDFBibTeX XML
Beck, József Some new applications of the probabilistic method. (Hungarian) Zbl 0612.05006 Mat. Lapok 32, 13-18 (1984). Reviewer: A.Huťa jun MSC: 05A05 05C65 05C15 PDFBibTeX XMLCite \textit{J. Beck}, Mat. Lapok 32, 13--18 (1984; Zbl 0612.05006)
Zhang, Zhongfu; Zhang, Jianxun; Wang, Jianfang A theorem on colouring edges. (English) Zbl 0602.05028 Kexue Tongbao, Foreign Lang. Ed. 29, 1137-1139 (1984). Reviewer: Z.Skupień MSC: 05C15 PDFBibTeX XMLCite \textit{Z. Zhang} et al., Kexue Tongbao, Sci. Bull. 29, 1137--1139 (1984; Zbl 0602.05028)
Stenzel, Lothar Über Automorphismen und über Kantenfärbungen von Quasigruppengraphen. (On automorphisms and edge colourings of quasigroups). (German) Zbl 0595.05037 Geometrie und Kombinatorik, 2. Kolloq., Karl-Marx-Stadt/DDR 1983, Vortr. 1, 2, Teil II 250-254 (1984). Reviewer: V.Havel MSC: 05C15 20N05 PDFBibTeX XML
Beikirch, Wolfgang Äquivalenz von Kantenfärbungen vollständiger Graphen und Quasigruppen. (Equivalence of edge colourings of complete graphs and quasigroups). (German) Zbl 0595.05036 Geometrie und Kombinatorik, 2. Kolloq., Karl-Marx-Stadt/DDR 1983, Vortr. 1, 2, Teil II 239-243 (1984). Reviewer: V.Havel MSC: 05C15 20N05 PDFBibTeX XML
Ninčák, Ján On a problem of R. Häggkvist concerning the edge colourings of bipartite graphs. (English) Zbl 0583.05026 Bull. Appl. Math. 34, No. 255, 117-126 (1984). Reviewer: J.G.Oxley MSC: 05C15 PDFBibTeX XMLCite \textit{J. Ninčák}, Bull. Appl. Math. 34, No. 255, 117--126 (1984; Zbl 0583.05026)
Donnelly, Peter; Welsh, Dominic The antivoter problem: Random 2-colourings of graphs. (English) Zbl 0579.60097 Graph theory and combinatorics, Proc. Conf. Hon. P. Erdős, Cambridge 1983, 133-144 (1984). Reviewer: C.McDiarmid MSC: 60K35 05C99 05C15 05C80 91B14 60G50 PDFBibTeX XML
Mekler, Alan H. c.c.c. forcing without combinatorics. (English) Zbl 0577.03025 J. Symb. Log. 49, 830-832 (1984). Reviewer: P.Štěpánek MSC: 03E40 03E35 PDFBibTeX XMLCite \textit{A. H. Mekler}, J. Symb. Log. 49, 830--832 (1984; Zbl 0577.03025) Full Text: DOI
Tverberg, Helge On Schmerl’s effective version of Brooks’ theorem. (English) Zbl 0576.05022 J. Comb. Theory, Ser. B 37, 27-30 (1984). MSC: 05C15 PDFBibTeX XMLCite \textit{H. Tverberg}, J. Comb. Theory, Ser. B 37, 27--30 (1984; Zbl 0576.05022) Full Text: DOI
Hajnal, András; Pach, J. Monochromatic paths in infinite coloured graphs. (English) Zbl 0566.05031 Finite and infinite sets, 6th Hung. Combin. Colloq., Eger/Hung. 1981, Vol. I, Colloq. Math. Soc. János Bolyai 37, No. 1, 359-369 (1984). Reviewer: I.Tomescu MSC: 05C15 05C38 05C55 PDFBibTeX XML
Borodin, O. V. Solution of Ringel’s problems concerning the vertex-faced coloring of planar graphs and the coloring of 1-planar graphs. (Russian) Zbl 0565.05027 Metody Diskretn. Anal. 41, 12-26 (1984). Reviewer: J.Širáň MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{O. V. Borodin}, Metody Diskretn. Anal. 41, 12--26 (1984; Zbl 0565.05027)
Hare, William R.; Laskar, Renu; Peters, Ken Max-min parameters and disconnected colorings. (English) Zbl 0562.05028 Combinatorics, graph theory and computing, Proc. 15th Southeast. Conf., La. State Univ. 1984, Congr. Numerantium 44, 139-150 (1984). Reviewer: P.Horak MSC: 05C35 05C15 05C40 PDFBibTeX XML
Chetwynd, A. G.; Hilton, A. J. W. The chromatic index of graphs of even order with many edges. (English) Zbl 0562.05024 J. Graph Theory 8, 463-470 (1984). Reviewer: L.Caccetta MSC: 05C15 PDFBibTeX XMLCite \textit{A. G. Chetwynd} and \textit{A. J. W. Hilton}, J. Graph Theory 8, 463--470 (1984; Zbl 0562.05024) Full Text: DOI
Wu, Xiumin Recent developments on graph theory. (Chinese) Zbl 0562.05019 Adv. Math., Beijing 13, No. 4, 241-253 (1984). Reviewer: R.C.Read MSC: 05Cxx 05C99 05-02 01A60 01A65 PDFBibTeX XMLCite \textit{X. Wu}, Adv. Math., Beijing 13, No. 4, 241--253 (1984; Zbl 0562.05019)
Chetwynd, A. G.; Hilton, A. J. W. The chromatic index of graphs with at most four vertices of maximum degree. (English) Zbl 0561.05023 Combinatorics, graph theory and computing, Proc. 15th Southeast. Conf., La. State Univ. 1984, Congr. Numerantium 43, 221-248 (1984). Reviewer: I.Tomescu MSC: 05C15 PDFBibTeX XML
Fenner, T. I.; Frieze, A. M. On the complexity of finding sets of edges in graphs and digraphs. (English) Zbl 0558.05019 Progress in graph theory, Proc. Conf. Combinatorics, Waterloo/Ont. 1982, 219-232 (1984). Reviewer: M.M.Sysło MSC: 05C15 68Q25 68R10 05C38 05C45 05C05 05C70 PDFBibTeX XML
Schumacher, H. Ein 7-Farbensatz 1-einbettbarer Graphen auf der projektiven Ebene. (German) Zbl 0557.05037 Abh. Math. Semin. Univ. Hamb. 54, 5-14 (1984). Reviewer: J.Širáň MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{H. Schumacher}, Abh. Math. Semin. Univ. Hamb. 54, 5--14 (1984; Zbl 0557.05037) Full Text: DOI
Reid, K. B. Monochromatic reachability, complementary cycles, and single arc reversals in tournaments. (English) Zbl 0556.05031 Graph theory, Proc. 1st Southeast Asian Colloq., Singapore 1983, Lect. Notes Math. 1073, 11-21 (1984). Reviewer: C.Thomassen MSC: 05C20 05C15 05C38 PDFBibTeX XML
Voss, H.-J. Independent sets in \((k+1)\)-colorations of k-chromatic graphs. (English) Zbl 0555.05036 Wiss. Z. Tech. Hochsch. Ilmenau 30, No. 1, 27-36 (1984). Reviewer: B.Toft MSC: 05C15 PDFBibTeX XMLCite \textit{H. J. Voss}, Wiss. Z. Tech. Hochsch. Ilmenau 30, No. 1, 27--36 (1984; Zbl 0555.05036)
Aspvall, Bengt; Gilbert, John R. Graph coloring using eigenvalue decomposition. (English) Zbl 0554.05048 SIAM J. Algebraic Discrete Methods 5, 526-538 (1984). Reviewer: D.Cvetković MSC: 05C50 05C15 PDFBibTeX XMLCite \textit{B. Aspvall} and \textit{J. R. Gilbert}, SIAM J. Algebraic Discrete Methods 5, 526--538 (1984; Zbl 0554.05048) Full Text: DOI Link
Fiamčík, Jozef Acyclic chromatic index of a subdivided graph. (English) Zbl 0554.05027 Arch. Math., Brno 20, 69-82 (1984). Reviewer: I.Tomescu MSC: 05C15 PDFBibTeX XMLCite \textit{J. Fiamčík}, Arch. Math., Brno 20, 69--82 (1984; Zbl 0554.05027) Full Text: EuDML
Beutelspacher, A.; Hering, P.-R. Minimal graphs for which the chromatic number equals the maximal degree. (English) Zbl 0554.05025 Ars Comb. 18, 201-216 (1984). Reviewer: I.Tomescu MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{A. Beutelspacher} and \textit{P. R. Hering}, Ars Comb. 18, 201--216 (1984; Zbl 0554.05025)
Kannan, Ravi; Korte, Bernhard Approximative combinatorial algorithms. (English) Zbl 0551.90064 Mathematical programming, Proc. int. Congr., Rio de Janeiro 1981, 195-248 (1984). Reviewer: T.Ibaraki MSC: 90C10 05C35 68Q25 90C35 68R10 PDFBibTeX XML
Chetwynd, A. G.; Hilton, A. J. W. Partial edge-colourings of complete graphs or of graphs which are nearly complete. (English) Zbl 0549.05027 Graph theory and combinatorics, Proc. Conf. Hon. P. Erdös, Cambridge 1983, 81-97 (1984). Reviewer: J.Širáň MSC: 05C15 PDFBibTeX XML
Simon, Imre Word Ramsey theorems. (English) Zbl 0548.20043 Graph theory and combinatorics, Proc. Conf. Hon. P. Erdös, Cambridge 1983, 283-291 (1984). Reviewer: C.R.J.Clapham MSC: 20M05 05C55 05C15 PDFBibTeX XML
Li, Jiongsheng; Huang, Guoxun On t-edge colored complete graph \(K_ N\) of order N. (Chinese. English summary) Zbl 0548.05044 Acta Math. Appl. Sin. 7, 430-436 (1984). Reviewer: W.Li MSC: 05C55 PDFBibTeX XMLCite \textit{J. Li} and \textit{G. Huang}, Acta Math. Appl. Sin. 7, 430--436 (1984; Zbl 0548.05044)
Opencomb, W. E. [Bailey, R. A.; Cameron, P. J.; Chetwynd, A. G.; Daykin, D. E.; Hilton, A. J. W.; Holroyd, F. C.; Mason, J. H.; Nelsen, R.; Rowley, C. A.; Woodall, D. R.] On the intricacy of combinatorial construction problems. (English) Zbl 0548.05013 Discrete Math. 50, 71-97 (1984). Reviewer: K.Heinrich MSC: 05B15 05C45 05-02 05Bxx PDFBibTeX XMLCite \textit{W. E. Opencomb}, Discrete Math. 50, 71--97 (1984; Zbl 0548.05013) Full Text: DOI
Watson-Gandy, C. D. T. The multi-facility min-max Weber problem. (English) Zbl 0542.90033 Eur. J. Oper. Res. 18, 44-50 (1984). MSC: 90B05 PDFBibTeX XMLCite \textit{C. D. T. Watson-Gandy}, Eur. J. Oper. Res. 18, 44--50 (1984; Zbl 0542.90033) Full Text: DOI
Pop, I. Elements of algebraic topology. (Elemente de topologie algebricǎ). (Romanian) Zbl 0542.55001 Iaşi, România: Universitatea ”Al. I. Cuza” Iaşi, Facultatea de Matematica. XIII, 412 p. Lei 66.00 (1984). Reviewer: S.Papadima MSC: 55-01 55Q05 55N10 57Q05 55P55 57N05 57M10 57M05 57N25 PDFBibTeX XML
Beck, József; Spencer, Joel Well-distributed 2-colorings of integers relative to long arithmetic progressions. (English) Zbl 0536.10042 Acta Arith. 43, 287-294 (1984). Reviewer: Ian Anderson (Glasgow) MSC: 11K38 11B25 PDFBibTeX XMLCite \textit{J. Beck} and \textit{J. Spencer}, Acta Arith. 43, 287--294 (1984; Zbl 0536.10042) Full Text: DOI EuDML
Foregger, Marsha F. The skew chromatic index of a graph. (English) Zbl 0536.05028 Discrete Math. 49, 27-39 (1984). Reviewer: R.C.Mullin MSC: 05C15 05B15 PDFBibTeX XMLCite \textit{M. F. Foregger}, Discrete Math. 49, 27--39 (1984; Zbl 0536.05028) Full Text: DOI
Milazzo, F.; Vacirca, V On the total oriented s-chromatic number of some remarkable classes of antisymmetric complete digraphs. (Italian. English summary) Zbl 0534.05031 Boll. Unione Mat. Ital., VI. Ser., A 3, 151-157 (1984). Reviewer: R.C.Read MSC: 05C15 05C20 PDFBibTeX XMLCite \textit{F. Milazzo} and \textit{V Vacirca}, Boll. Unione Mat. Ital., VI. Ser., A 3, 151--157 (1984; Zbl 0534.05031)