Capalbo, M. R.; Kosaraju, S. R. Small universal graphs. (English) Zbl 1345.05097 Vitter, Jeffrey Scott (ed.) et al., Proceedings of the 31st annual ACM symposium on theory of computing, STOC 1999. Atlanta, GA, USA, May 1–4, 1999. New York, NY: ACM, Association for Computing Machinery (ISBN 1-58113-067-8). 741-749 (1999). MSC: 05C85 05C35 PDFBibTeX XMLCite \textit{M. R. Capalbo} and \textit{S. R. Kosaraju}, in: Proceedings of the 31st annual ACM symposium on theory of computing, STOC 1999. Atlanta, GA, USA, May 1--4, 1999. New York, NY: ACM, Association for Computing Machinery. 741--749 (1999; Zbl 1345.05097) Full Text: DOI
Zwick, Uri All pairs lightest shortest paths. (English) Zbl 1345.05106 Vitter, Jeffrey Scott (ed.) et al., Proceedings of the 31st annual ACM symposium on theory of computing, STOC 1999. Atlanta, GA, USA, May 1–4, 1999. New York, NY: ACM, Association for Computing Machinery (ISBN 1-58113-067-8). 61-69 (1999). MSC: 05C85 05C20 05C22 05C35 05C38 68Q25 PDFBibTeX XMLCite \textit{U. Zwick}, in: Proceedings of the 31st annual ACM symposium on theory of computing, STOC 1999. Atlanta, GA, USA, May 1--4, 1999. New York, NY: ACM, Association for Computing Machinery. 61--69 (1999; Zbl 1345.05106) Full Text: DOI
Ho, Chin-Wen; Chang, Jou-Ming Solving the all-pairs-shortest-length problem on chordal bipartite graphs. (English) Zbl 1339.05205 Inf. Process. Lett. 69, No. 2, 87-93 (1999). MSC: 05C38 05C35 05C85 PDFBibTeX XMLCite \textit{C.-W. Ho} and \textit{J.-M. Chang}, Inf. Process. Lett. 69, No. 2, 87--93 (1999; Zbl 1339.05205) Full Text: DOI Link
Azizoğlu, M. Cemil; Eğecioğlu, Ömer The isoperimetric number of \(d\)-dimensional \(k\)-ary arrays. (English) Zbl 1320.05063 Int. J. Found. Comput. Sci. 10, No. 3, 289-300 (1999). MSC: 05C35 05C76 68R10 PDFBibTeX XMLCite \textit{M. C. Azizoğlu} and \textit{Ö. Eğecioğlu}, Int. J. Found. Comput. Sci. 10, No. 3, 289--300 (1999; Zbl 1320.05063) Full Text: DOI
Nagamochi, Hiroshi; Ibaraki, Toshihide An approximation of the minimum vertex cover in a graph. (English) Zbl 1306.05193 Japan J. Ind. Appl. Math. 16, No. 3, 369-375 (1999). MSC: 05C70 05C35 05C85 PDFBibTeX XMLCite \textit{H. Nagamochi} and \textit{T. Ibaraki}, Japan J. Ind. Appl. Math. 16, No. 3, 369--375 (1999; Zbl 1306.05193) Full Text: DOI
Xavier, C.; Khare, Abhay Maximal clique separators in \(k\)-sep-chordal graphs and \(k\)-trees. (English) Zbl 1243.05135 Acta Cienc. Indica, Math. 25, No. 3, 331-334 (1999). MSC: 05C40 05C69 05C35 PDFBibTeX XMLCite \textit{C. Xavier} and \textit{A. Khare}, Acta Cienc. Indica, Math. 25, No. 3, 331--334 (1999; Zbl 1243.05135)
Balińska, Krystyna T.; Quintas, Louis V. Maximum outdegrees in a digraph whose nodes are graphs with bounded degree. (English) Zbl 1109.05310 Sali, A. (ed.) et al., Paul Erdős and his mathematics. Papers from the international conference held in memory of Paul Erdős in Budapest, Hungary, July 4–11, 1999. Budapest: János Bolyai Mathematical Society (ISBN 963-8022-93-0). 23-26 (1999). MSC: 05C20 05C35 PDFBibTeX XMLCite \textit{K. T. Balińska} and \textit{L. V. Quintas}, in: Paul Erdős and his mathematics. Papers from the international conference held in memory of Paul Erdős in Budapest, Hungary, July 4--11, 1999. Budapest: János Bolyai Mathematical Society. 23--26 (1999; Zbl 1109.05310)
Ferrero, Daniela Maximally connected hyperdigraphs. (English) Zbl 1109.05316 Sali, A. (ed.) et al., Paul Erdős and his mathematics. Papers from the international conference held in memory of Paul Erdős in Budapest, Hungary, July 4–11, 1999. Budapest: János Bolyai Mathematical Society (ISBN 963-8022-93-0). 62-64 (1999). MSC: 05C40 05C20 05C35 05C65 PDFBibTeX XMLCite \textit{D. Ferrero}, in: Paul Erdős and his mathematics. Papers from the international conference held in memory of Paul Erdős in Budapest, Hungary, July 4--11, 1999. Budapest: János Bolyai Mathematical Society. 62--64 (1999; Zbl 1109.05316)
Kubicki, Grzegorz Absorbing common subgraphs revisited. (English) Zbl 1109.05313 Sali, A. (ed.) et al., Paul Erdős and his mathematics. Papers from the international conference held in memory of Paul Erdős in Budapest, Hungary, July 4–11, 1999. Budapest: János Bolyai Mathematical Society (ISBN 963-8022-93-0). 149-151 (1999). MSC: 05C35 PDFBibTeX XMLCite \textit{G. Kubicki}, in: Paul Erdős and his mathematics. Papers from the international conference held in memory of Paul Erdős in Budapest, Hungary, July 4--11, 1999. Budapest: János Bolyai Mathematical Society. 149--151 (1999; Zbl 1109.05313)
Yegnanarayanan, V. On some extremal graph coloring problems of Nordhaus Gaddum class. (English) Zbl 1100.05503 Bull. Allahabad Math. Soc. 14, 147-158 (1999). MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{V. Yegnanarayanan}, Bull. Allahabad Math. Soc. 14, 147--158 (1999; Zbl 1100.05503)
Khadzhilvanov, Nikolaĭ On \(K_4'\)-graphs. (Russian. English summary) Zbl 1079.05509 God. Sofij. Univ., Fak. Mat. Inform. 87(1993), No. 1, 271-277 (1999). MSC: 05C35 05C15 PDFBibTeX XMLCite \textit{N. Khadzhilvanov}, God. Sofiĭ. Univ., Fak. Mat. Inform. 87, No. 1, 271--277 (1999; Zbl 1079.05509)
Berceanu, Cornel The Tutte polynomial in the forbidden subgraph problem. (English) Zbl 1049.05508 Stud. Cercet. Ştiinţ., Ser. Mat., Univ. Bacău 9, 9-14 (1999). MSC: 05C35 PDFBibTeX XMLCite \textit{C. Berceanu}, Stud. Cercet. Științ., Ser. Mat., Univ. Bacău 9, 9--14 (1999; Zbl 1049.05508)
Korte, Bernard; Nešetřil, Jaroslav The work of Vojtěch Jarník in combinatorial optimization. (Czech) Zbl 1055.01516 Pokroky Mat. Fyz. Astron. 44, No. 3, 187-200 (1999). Reviewer: Jiří Rákosník (Praha) MSC: 01A70 90C27 90-03 PDFBibTeX XMLCite \textit{B. Korte} and \textit{J. Nešetřil}, Pokroky Mat. Fyz. Astron. 44, No. 3, 187--200 (1999; Zbl 1055.01516)
Muga, Felix P. II Maximal order of 3- and 5-regular circulant graphs. (English) Zbl 1034.05027 Matimyas Mat. 22, No. 3, 33-38 (1999). MSC: 05C35 05B45 PDFBibTeX XMLCite \textit{F. P. Muga II}, Matimyás Mat. 22, No. 3, 33--38 (1999; Zbl 1034.05027)
Li, Deming; Liu, Yanpei A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs. (English) Zbl 1012.05058 Acta Math. Appl. Sin., Engl. Ser. 15, No. 4, 361-367 (1999). MSC: 05C10 05C35 PDFBibTeX XMLCite \textit{D. Li} and \textit{Y. Liu}, Acta Math. Appl. Sin., Engl. Ser. 15, No. 4, 361--367 (1999; Zbl 1012.05058) Full Text: DOI
Jendrol’, Stanislav Paths with restricted degrees of their vertices in planar graphs. (English) Zbl 1003.05055 Czech. Math. J. 49, No. 3, 481-490 (1999). MSC: 05C35 05C38 PDFBibTeX XMLCite \textit{S. Jendrol'}, Czech. Math. J. 49, No. 3, 481--490 (1999; Zbl 1003.05055) Full Text: DOI EuDML
Fremuth-Paeger, Christian; Jungnickel, Dieter Balanced network flows. II: Simple augmentation algorithms. (English) Zbl 0999.90006 Networks 33, No. 1, 29-41 (1999). Reviewer: Matthias Ehrgott (Auckland) MSC: 90B10 05C35 05C70 PDFBibTeX XMLCite \textit{C. Fremuth-Paeger} and \textit{D. Jungnickel}, Networks 33, No. 1, 29--41 (1999; Zbl 0999.90006) Full Text: DOI
Che, Xiangkai A theorem on the circumference of a 3-connected claw-free graph. (Chinese. English summary) Zbl 0989.05067 J. Northeast. Univ., Nat. Sci. 20, No. 4, 434-437 (1999). MSC: 05C40 05C35 PDFBibTeX XMLCite \textit{X. Che}, J. Northeast. Univ., Nat. Sci. 20, No. 4, 434--437 (1999; Zbl 0989.05067)
Xu, Yinfeng; Wang, Kanliang; Zhu, Binhai On the \(k\)-taxi problem. (English) Zbl 1073.90516 Information 2, No. 4, 429-434 (1999). MSC: 90B35 05C35 PDFBibTeX XMLCite \textit{Y. Xu} et al., Information 2, No. 4, 429--434 (1999; Zbl 1073.90516)
Yamashita, Masafumi; Kameda, Tsunehiko Modeling \(k\)-coteries by well-covered graphs. (English) Zbl 0984.05047 Networks 34, No. 3, 221-228 (1999). MSC: 05C35 05C69 90C35 PDFBibTeX XMLCite \textit{M. Yamashita} and \textit{T. Kameda}, Networks 34, No. 3, 221--228 (1999; Zbl 0984.05047) Full Text: DOI
Duin, Cees; Voß, Stefan The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs. (English) Zbl 0980.90094 Networks 34, No. 3, 181-191 (1999). MSC: 90C35 90C27 05C35 90C59 PDFBibTeX XMLCite \textit{C. Duin} and \textit{S. Voß}, Networks 34, No. 3, 181--191 (1999; Zbl 0980.90094) Full Text: DOI
Ali, Ali A.; Staton, William The extremal question for cycles with chords. (English) Zbl 0977.05068 Ars Comb. 51, 193-197 (1999). Reviewer: Martin Klazar (Praha) MSC: 05C38 05C35 PDFBibTeX XMLCite \textit{A. A. Ali} and \textit{W. Staton}, Ars Comb. 51, 193--197 (1999; Zbl 0977.05068)
Kim, Suh-Ryung On the inequality \(dk(G)\leq k(G)+1\). (English) Zbl 0977.05065 Ars Comb. 51, 173-182 (1999). Reviewer: Zdeněk Ryjáček (Plzeň) MSC: 05C35 PDFBibTeX XMLCite \textit{S.-R. Kim}, Ars Comb. 51, 173--182 (1999; Zbl 0977.05065)
Arumugam, S.; Velammal, S. Maximum size of a connected graph with given domination parameters. (English) Zbl 0977.05094 Ars Comb. 52, 221-227 (1999). Reviewer: Bohdan Zelinka (Liberec) MSC: 05C69 05C35 PDFBibTeX XMLCite \textit{S. Arumugam} and \textit{S. Velammal}, Ars Comb. 52, 221--227 (1999; Zbl 0977.05094)
Dunbar, J. E.; Hattingh, J. H.; Laskar, R. C.; Markus, L. R. Domination using induced cliques in graphs. (English) Zbl 0977.05093 Ars Comb. 52, 129-139 (1999). Reviewer: Bohdan Zelinka (Liberec) MSC: 05C69 05C35 PDFBibTeX XMLCite \textit{J. E. Dunbar} et al., Ars Comb. 52, 129--139 (1999; Zbl 0977.05093)
Alevras, Dimitris Small min-cut polyhedra. (English) Zbl 0977.90068 Math. Oper. Res. 24, No. 1, 35-49 (1999). MSC: 90C35 05C35 PDFBibTeX XMLCite \textit{D. Alevras}, Math. Oper. Res. 24, No. 1, 35--49 (1999; Zbl 0977.90068) Full Text: DOI
Lai, Chunhui The edge numbers of a class of graphs. (Chinese. English summary) Zbl 0979.05066 J. Zhangzhou Teach. Coll., Nat. Sci. 12, No. 2, 7-9, 20 (1999). MSC: 05C35 PDFBibTeX XMLCite \textit{C. Lai}, J. Zhangzhou Teach. Coll., Nat. Sci. 12, No. 2, 7--9, 20 (1999; Zbl 0979.05066)
Tomescu, Ioan Some extremal properties of the degree distance of a graph. (English) Zbl 0997.05051 Smeureanu, Ion (ed.) et al., Information technology. Proceedings of the 4th international symposium on economic informatics held in Bucharest, Romania, May 6-9, 1999. Bucharest: Editura Inforec. 651-656 (1999). MSC: 05C35 05C12 PDFBibTeX XMLCite \textit{I. Tomescu}, in: Information technology. Proceedings of the 4th international symposium on economic informatics held in Bucharest, Romania, May 6--9, 1999. Bucharest: Editura Inforec. 651--656 (1999; Zbl 0997.05051)
Walther, Hansjoachim Polyhedral graphs with extreme numbers of types of faces. (English) Zbl 1072.05539 Broersma, H. J. (ed.) et al., 6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26–28, 1999. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 3, no pag., electronic only (1999). MSC: 05C35 PDFBibTeX XMLCite \textit{H. Walther}, Electron. Notes Discrete Math. 3, no pag. (1999; Zbl 1072.05539) Full Text: Link
Hartmann, Mark; Özlük, Özgur Solving the traveling circus problem by branch & cut. (English) Zbl 1038.90547 Broersma, H. J. (ed.) et al., 6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26–28, 1999. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 3, no pag., electronic only (1999). MSC: 90C35 05C85 05C35 PDFBibTeX XMLCite \textit{M. Hartmann} and \textit{Ö. Özlük}, Electron. Notes Discrete Math. 3, no pag. (1999; Zbl 1038.90547) Full Text: Link
Greinus, J.; Brinkmann, G. Patches with minimal boundary length. (English) Zbl 1072.05538 Broersma, H. J. (ed.) et al., 6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26–28, 1999. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 3, no pag., electronic only (1999). MSC: 05C35 PDFBibTeX XMLCite \textit{J. Greinus} and \textit{G. Brinkmann}, Electron. Notes Discrete Math. 3, no pag. (1999; Zbl 1072.05538) Full Text: Link
Corinne, Feremans; Martine, Labbé; Gilbert, Laporte The generalized minimum spanning tree: polyhedra and branch-and-cut. (English) Zbl 1038.90546 Broersma, H. J. (ed.) et al., 6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26–28, 1999. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 3, no pag., electronic only (1999). MSC: 90C35 90C57 05C35 PDFBibTeX XMLCite \textit{F. Corinne} et al., Electron. Notes Discrete Math. 3, no pag. (1999; Zbl 1038.90546) Full Text: Link
Fack, V.; Lievens, S.; Van der Jeugt, J. On bounds for the rotation distance between binary coupling trees. (English) Zbl 1039.05515 Broersma, H. J. (ed.) et al., 6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26–28, 1999. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 3, no pag., electronic only (1999). MSC: 05C35 05C05 PDFBibTeX XMLCite \textit{V. Fack} et al., Electron. Notes Discrete Math. 3, no pag. (1999; Zbl 1039.05515) Full Text: Link
Blasum, Ulrich; Hochstättler, Winfried; Oertel, Peter STEINER-diagrams. (English) Zbl 1039.05530 Broersma, H. J. (ed.) et al., 6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26–28, 1999. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 3, no pag., electronic only (1999). MSC: 05C85 05C20 05C35 PDFBibTeX XMLCite \textit{U. Blasum} et al., Electron. Notes Discrete Math. 3, no pag. (1999; Zbl 1039.05530) Full Text: Link
Esposito, Floriana; Malerba, Donato; Semeraro, Giovanni; Tamma, Valentina The effects of pruning methods on the predictive accuracy of induced decision trees. (English) Zbl 0963.68149 Appl. Stoch. Models Bus. Ind. 15, No. 4, 277-299 (1999). Reviewer: A.V.Swishchuk (Kyïv) MSC: 68R10 62C12 62M20 05C05 05D40 PDFBibTeX XMLCite \textit{F. Esposito} et al., Appl. Stoch. Models Bus. Ind. 15, No. 4, 277--299 (1999; Zbl 0963.68149) Full Text: DOI
Liu, Linzhong; Zhang, Zhongfu The edge-binding number of some graphs. (Chinese. English summary) Zbl 0962.05029 J. Lanzhou Railw. Inst. 18, No. 3, 102-105 (1999). MSC: 05C35 PDFBibTeX XMLCite \textit{L. Liu} and \textit{Z. Zhang}, J. Lanzhou Railw. Inst. 18, No. 3, 102--105 (1999; Zbl 0962.05029)
Parvathy, K. S.; Vijayakumar, A. Geodesic iteration number. (English) Zbl 0957.05060 Balakrishnan, R. (ed.) et al., Graph connections. Proceedings of the conference, Cochin, India, January 28-31, 1998. New Delhi: Allied Publishers Limited. 91-94 (1999). MSC: 05C35 05C38 PDFBibTeX XMLCite \textit{K. S. Parvathy} and \textit{A. Vijayakumar}, in: Graph connections. Proceedings of the conference, Cochin, India, January 28--31, 1998. New Delhi: Allied Publishers Limited. 91--94 (1999; Zbl 0957.05060)
Böhme, Thomas; Broersma, Hajo; Tuinstra, Hilde A note on a conjecture concerning tree-partitioning \(3\)-regular graphs. (English) Zbl 0951.05083 Tatra Mt. Math. Publ. 18, 15-21 (1999). Reviewer: Jaroslav Ivančo (Košice) MSC: 05C70 05C45 05C38 05C35 05C05 PDFBibTeX XMLCite \textit{T. Böhme} et al., Tatra Mt. Math. Publ. 18, 15--21 (1999; Zbl 0951.05083)
Marton, László A label-setting algorithm for calculating shortest path trees in sparse networks. (Hungarian) Zbl 0949.05077 Alkalmazott Mat. Lapok 19, No. 2, 115-132 (1999). Reviewer: Tibor Csendes (Szeged) MSC: 05C85 05C38 05C35 90C35 PDFBibTeX XMLCite \textit{L. Marton}, Alkalmazott Mat. Lapok 19, No. 2, 115--132 (1999; Zbl 0949.05077)
Ivanov, A. O.; Tuzhilin, A. A. The space of parallel linear networks with a fixed boundary. (English. Russian original) Zbl 0967.05039 Izv. Math. 63, No. 5, 923-962 (1999); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 63, No. 4, 83-126 (1999). Reviewer: Du Ding-Zhu (Minneapolis) MSC: 05C35 68U05 90C35 52B55 68R10 PDFBibTeX XMLCite \textit{A. O. Ivanov} and \textit{A. A. Tuzhilin}, Izv. Math. 63, No. 5, 923--962 (1999; Zbl 0967.05039); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 63, No. 4, 83--126 (1999) Full Text: DOI
Rahman, Md. Saidur; Nakano, Shin-ichi; Nishizeki, Takao A linear algorithm for bend-optimal orthogonal drawings of triconnected cubic plane graphs. (English) Zbl 0946.05078 J. Graph Algorithms Appl. 3, No. 4, 31-62 (1999). MSC: 05C85 05C10 68R10 05C35 PDFBibTeX XMLCite \textit{Md. S. Rahman} et al., J. Graph Algorithms Appl. 3, No. 4, 31--62 (1999; Zbl 0946.05078) Full Text: DOI EuDML
Dzedzej, Zdzisław; Idzik, Adam; Izydorek, Marek Borsuk-Ulam type theorems on product spaces. II. (English) Zbl 0961.47032 Topol. Methods Nonlinear Anal. 14, No. 2, 345-352 (1999). Reviewer: M.Kučera (Praha) MSC: 47H04 05C35 55M20 52A20 PDFBibTeX XMLCite \textit{Z. Dzedzej} et al., Topol. Methods Nonlinear Anal. 14, No. 2, 345--352 (1999; Zbl 0961.47032) Full Text: DOI
Woźniak, Mariusz On cyclically embeddable graphs. (English) Zbl 0958.05041 Discuss. Math., Graph Theory 19, No. 2, 241-248 (1999). MSC: 05C10 05C70 05C35 PDFBibTeX XMLCite \textit{M. Woźniak}, Discuss. Math., Graph Theory 19, No. 2, 241--248 (1999; Zbl 0958.05041) Full Text: DOI
Borowiecki, Mieczysław; Mihók, Peter; Tuza, Zsolt; Voigt, Margit Remarks on the existence of uniquely partitionable planar graphs. (English) Zbl 0958.05118 Discuss. Math., Graph Theory 19, No. 2, 159-166 (1999). MSC: 05C75 05C35 PDFBibTeX XMLCite \textit{M. Borowiecki} et al., Discuss. Math., Graph Theory 19, No. 2, 159--166 (1999; Zbl 0958.05118) Full Text: DOI Link
Müller, Haiko Asteroidal sets in graphs. (English) Zbl 0947.05074 Jena: Univ. Jena, Fakultät für Mathematik und Informatik (Habil.), 104 p. (1999). MSC: 05C85 05C69 05C35 05C50 68R10 PDFBibTeX XMLCite \textit{H. Müller}, Asteroidal sets in graphs. Jena: Univ. Jena, Fakultät für Mathematik und Informatik (Habil.) (1999; Zbl 0947.05074)
Dong, F. M.; Koh, K. M. The acyclic colouring, triangle number and chromatic polynomial of a graph. (English) Zbl 0952.05027 Shum, Kar-Ping (ed.) et al., Algebras and combinatorics. Papers from the international congress, ICAC’97, Hong Kong, August 1997. Singapore: Springer. 217-236 (1999). MSC: 05C15 05C35 05C75 PDFBibTeX XMLCite \textit{F. M. Dong} and \textit{K. M. Koh}, in: Algebras and combinatorics. Papers from the international congress, ICAC'97, Hong Kong, August 1997. Singapore: Springer. 217--236 (1999; Zbl 0952.05027)
Bollobás, Béla; Thomason, Andrew Weakly pancyclic graphs. (English) Zbl 1023.05083 J. Comb. Theory, Ser. B 77, No. 1, 121-137 (1999). MSC: 05C38 05C35 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{A. Thomason}, J. Comb. Theory, Ser. B 77, No. 1, 121--137 (1999; Zbl 1023.05083) Full Text: DOI
Penrose, Mathew D. A strong law for the largest nearest-neighbour link between random points. (English) Zbl 0955.60009 J. Lond. Math. Soc., II. Ser. 60, No. 3, 951-960 (1999). Reviewer: Nicko G.Gamkrelidze (Moskva) MSC: 60D05 60F15 60G70 PDFBibTeX XMLCite \textit{M. D. Penrose}, J. Lond. Math. Soc., II. Ser. 60, No. 3, 951--960 (1999; Zbl 0955.60009) Full Text: DOI
Bollobás, B.; Scott, A. D. Exact bounds for judicious partitions of graphs. (English) Zbl 0985.05028 Combinatorica 19, No. 4, 473-486 (1999). Reviewer: Péter Komjáth (Budapest) MSC: 05C35 PDFBibTeX XMLCite \textit{B. Bollobás} and \textit{A. D. Scott}, Combinatorica 19, No. 4, 473--486 (1999; Zbl 0985.05028) Full Text: DOI
Petingi, L.; Rodriguez, J. On the conjecture that among all graphs on \(n\) nodes and \(e\) edges, one with maximum number of spanning trees must be almost-regular. (English) Zbl 0965.05037 Congr. Numerantium 136, 207-214 (1999). MSC: 05C05 05C35 05C50 05C07 05C75 PDFBibTeX XMLCite \textit{L. Petingi} and \textit{J. Rodriguez}, Congr. Numerantium 136, 207--214 (1999; Zbl 0965.05037)
Nagle, Brendan Turán related problems for hypergraphs. (English) Zbl 0965.05062 Congr. Numerantium 136, 119-127 (1999). MSC: 05C35 05C65 05B07 PDFBibTeX XMLCite \textit{B. Nagle}, Congr. Numerantium 136, 119--127 (1999; Zbl 0965.05062)
Hurlbert, Glenn H. A survey of graph pebbling. (English) Zbl 0961.05067 Congr. Numerantium 139, 41-64 (1999). MSC: 05C99 05D05 06A07 11B75 91A43 PDFBibTeX XMLCite \textit{G. H. Hurlbert}, Congr. Numerantium 139, 41--64 (1999; Zbl 0961.05067) Full Text: arXiv
Koker, John; Moghadam, Hosien; Winters, Steven J. The periphery of edge-deleted graphs. (English) Zbl 0960.05046 Congr. Numerantium 140, 213-221 (1999). MSC: 05C12 05C35 PDFBibTeX XMLCite \textit{J. Koker} et al., Congr. Numerantium 140, 213--221 (1999; Zbl 0960.05046)
Johnson, P. D. jun.; Roblee, K. J. More extremal graphs for a maximal-joint-neighborhood, average-triangles-per-edge inequality. (English) Zbl 0961.05039 Congr. Numerantium 140, 87-95 (1999). MSC: 05C35 05E30 05C75 PDFBibTeX XMLCite \textit{P. D. Johnson jun.} and \textit{K. J. Roblee}, Congr. Numerantium 140, 87--95 (1999; Zbl 0961.05039)
Golumbic, Martin Charles; Rotics, Udi The clique-width of unit interval graphs is unbounded. (English) Zbl 0960.05075 Congr. Numerantium 140, 5-17 (1999). MSC: 05C69 05C78 05C17 05C35 PDFBibTeX XMLCite \textit{M. C. Golumbic} and \textit{U. Rotics}, Congr. Numerantium 140, 5--17 (1999; Zbl 0960.05075)
Piazza, Barry; Stueckle, Sam A lower bound for edge-tenacity. (English) Zbl 0968.05044 Congr. Numerantium 137, 193-196 (1999). MSC: 05C35 05C50 PDFBibTeX XMLCite \textit{B. Piazza} and \textit{S. Stueckle}, Congr. Numerantium 137, 193--196 (1999; Zbl 0968.05044)
Fitzpatrick, Shannon L. The isometric path number of the Cartesian product of paths. (English) Zbl 0968.05043 Congr. Numerantium 137, 109-119 (1999). MSC: 05C35 05C38 PDFBibTeX XMLCite \textit{S. L. Fitzpatrick}, Congr. Numerantium 137, 109--119 (1999; Zbl 0968.05043)
Eroh, Linda; Schwenk, Allen Cages of girth 5 and 7. (English) Zbl 0968.05042 Congr. Numerantium 138, 157-173 (1999). MSC: 05C35 05C50 PDFBibTeX XMLCite \textit{L. Eroh} and \textit{A. Schwenk}, Congr. Numerantium 138, 157--173 (1999; Zbl 0968.05042)
Fischer, Lisa R. On the order of extremal \(k-\varepsilon\) almost regular graphs. (English) Zbl 0964.05033 Congr. Numerantium 138, 79-92 (1999). Reviewer: Lutz Volkmann (Aachen) MSC: 05C35 PDFBibTeX XMLCite \textit{L. R. Fischer}, Congr. Numerantium 138, 79--92 (1999; Zbl 0964.05033)
Chang, An Sub-large value and quasi-small value of the largest eigenvalue of the trees with perfect matchings. (Chinese. English summary) Zbl 0942.05044 Appl. Math., Ser. A (Chin. Ed.) 14, No. 4, 397-403 (1999). MSC: 05C50 05C05 05C35 05C70 PDFBibTeX XMLCite \textit{A. Chang}, Appl. Math., Ser. A (Chin. Ed.) 14, No. 4, 397--403 (1999; Zbl 0942.05044)
Jendrol’, S.; Voss, H.-J. Subgraphs with restricted degrees of their vertices in large polyhedral maps on compact two-manifolds. (English) Zbl 0942.05018 Eur. J. Comb. 20, No. 8, 821-832 (1999). Reviewer: S.L.Bezrukov (Superior) MSC: 05C10 05C35 PDFBibTeX XMLCite \textit{S. Jendrol'} and \textit{H. J. Voss}, Eur. J. Comb. 20, No. 8, 821--832 (1999; Zbl 0942.05018) Full Text: DOI
Buhrman, Harry; Li, Ming; Tromp, John; Vitányi, Paul Kolmogorov random graphs and the incompressibility method. (English) Zbl 0939.68054 SIAM J. Comput. 29, No. 2, 590-599 (1999). MSC: 68Q30 05C35 05C30 05C80 PDFBibTeX XMLCite \textit{H. Buhrman} et al., SIAM J. Comput. 29, No. 2, 590--599 (1999; Zbl 0939.68054) Full Text: DOI arXiv
Cockayne, E. J.; Mynhardt, C. M. On a conjecture concerning irredundant and perfect neighbourhood sets in graphs. (English) Zbl 0949.05060 J. Comb. Math. Comb. Comput. 31, 241-253 (1999). Reviewer: G.Wegner (Dortmund) MSC: 05C69 05C35 PDFBibTeX XMLCite \textit{E. J. Cockayne} and \textit{C. M. Mynhardt}, J. Comb. Math. Comb. Comput. 31, 241--253 (1999; Zbl 0949.05060)
Favaron, Odile; Kabanov, Vladislav; Puech, Joël The ratio of three domination parameters in some classes of claw-free graphs. (English) Zbl 0944.05071 J. Comb. Math. Comb. Comput. 31, 151-159 (1999). Reviewer: Bohdan Zelinka (Liberec) MSC: 05C69 05C35 PDFBibTeX XMLCite \textit{O. Favaron} et al., J. Comb. Math. Comb. Comput. 31, 151--159 (1999; Zbl 0944.05071)
Duncan, Jack R.; Jacobson, Michael S. On tournaments with domination number exactly \(k\). (English) Zbl 0944.05069 J. Comb. Math. Comb. Comput. 31, 129-136 (1999). Reviewer: Bohdan Zelinka (Liberec) MSC: 05C69 05C20 05C35 PDFBibTeX XMLCite \textit{J. R. Duncan} and \textit{M. S. Jacobson}, J. Comb. Math. Comb. Comput. 31, 129--136 (1999; Zbl 0944.05069)
Haynes, Teresa W. Extremal domination insensitive graphs. (English) Zbl 0944.05070 J. Comb. Math. Comb. Comput. 31, 113-127 (1999). Reviewer: Bohdan Zelinka (Liberec) MSC: 05C69 05C35 PDFBibTeX XMLCite \textit{T. W. Haynes}, J. Comb. Math. Comb. Comput. 31, 113--127 (1999; Zbl 0944.05070)
Burger, A. P.; Mynhardt, C. M. Queens on hexagonal boards. (English) Zbl 0944.05068 J. Comb. Math. Comb. Comput. 31, 97-111 (1999). Reviewer: Bohdan Zelinka (Liberec) MSC: 05C69 05C35 PDFBibTeX XMLCite \textit{A. P. Burger} and \textit{C. M. Mynhardt}, J. Comb. Math. Comb. Comput. 31, 97--111 (1999; Zbl 0944.05068)
Bezrukov, S. L.; Elsässer, R.; Schroeder, U.-P. On bounds for the \(k\)-partitioning of graphs. (English) Zbl 0949.05042 Asano, Takao (ed.) et al., Computing and combinatorics. 5th annual international conference. COCOON ’99, Tokyo, Japan, July 26-28, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1627, 154-163 (1999). Reviewer: J.Bierbrauer (Houghton) MSC: 05C35 05C70 68R10 PDFBibTeX XMLCite \textit{S. L. Bezrukov} et al., Lect. Notes Comput. Sci. 1627, 154--163 (1999; Zbl 0949.05042) Full Text: DOI
Alekseev, V. E. A polynomial algorithm for finding largest independent sets in fork-free graphs. (English. Russian original) Zbl 0931.05078 Discrete Appl. Math. 135, No. 1-3, 3-16 (2004); translation from Diskretn. Anal. Issled. Oper., Ser. 1 6, No. 4, 3-19 (1999). Reviewer: O.V.Borodin (Novosibirsk) MSC: 05C85 05C69 05C35 PDFBibTeX XMLCite \textit{V. E. Alekseev}, Diskretn. Anal. Issled. Oper., Ser. 1 6, No. 4, 3--19 (1999; Zbl 0931.05078); translation from Diskretn. Anal. Issled. Oper., Ser. 1 6, No. 4, 3--19 (1999) Full Text: DOI
Chernyak, A. A. Residual reliability of \(P\)-threshold graphs. (English. Russian original) Zbl 0930.05089 Discrete Appl. Math. 135, No. 1-3, 83-95 (2004); translation from Diskretn. Anal. Issled. Oper., Ser. 1 6, No. 3, 71-86 (1999). Reviewer: O.V.Borodin (Novosibirsk) MSC: 05C85 05C35 05C90 PDFBibTeX XMLCite \textit{A. A. Chernyak}, Diskretn. Anal. Issled. Oper., Ser. 1 6, No. 3, 71--86 (1999; Zbl 0930.05089); translation from Diskretn. Anal. Issled. Oper., Ser. 1 6, No. 3, 71--86 (1999) Full Text: DOI
Shi, Minẏong; Yuan, Xudong; Cai, Mao-cheng; Favaron, Odile \((3, k)\)-factor-critical graphs and toughness. (English) Zbl 0939.05069 Graphs Comb. 15, No. 4, 463-471 (1999). MSC: 05C70 05C35 05C75 PDFBibTeX XMLCite \textit{M. Shi} et al., Graphs Comb. 15, No. 4, 463--471 (1999; Zbl 0939.05069) Full Text: DOI
Pikhurko, Oleg The minimum size of saturated hypergraphs. (English) Zbl 0938.05035 Comb. Probab. Comput. 8, No. 5, 483-492 (1999). Reviewer: J.W.Moon (Edmonton) MSC: 05C35 05C65 PDFBibTeX XMLCite \textit{O. Pikhurko}, Comb. Probab. Comput. 8, No. 5, 483--492 (1999; Zbl 0938.05035) Full Text: DOI
Guattery, S.; Leighton, T.; Miller, G. L. The path resistance method for bounding the smallest nontrivial eigenvalue of a Laplacian. (English) Zbl 0937.05054 Comb. Probab. Comput. 8, No. 5, 441-460 (1999). Reviewer: Fedor Fomin (St.Peterburg) MSC: 05C50 05C35 05C05 05C10 PDFBibTeX XMLCite \textit{S. Guattery} et al., Comb. Probab. Comput. 8, No. 5, 441--460 (1999; Zbl 0937.05054) Full Text: DOI
Alt, Helmut; Fuchs, Ulrich; Kriegel, Klaus On the number of simple cycles in planar graphs. (English) Zbl 0936.05062 Comb. Probab. Comput. 8, No. 5, 397-405 (1999). Reviewer: P.Horák (Safat) MSC: 05C38 05C35 05C30 PDFBibTeX XMLCite \textit{H. Alt} et al., Comb. Probab. Comput. 8, No. 5, 397--405 (1999; Zbl 0936.05062) Full Text: DOI
Chen, L. Optimal computation of shortest paths on doubly convex bipartite graphs. (English) Zbl 0931.90061 Comput. Math. Appl. 38, No. 3-4, 1-12 (1999). MSC: 90C35 68R10 05C38 05C35 68W15 PDFBibTeX XMLCite \textit{L. Chen}, Comput. Math. Appl. 38, No. 3--4, 1--12 (1999; Zbl 0931.90061) Full Text: DOI
Tomescu, Ioan Some extremal properties of the degree distance of a graph. (English) Zbl 0936.05038 Discrete Appl. Math. 98, No. 1-2, 159-163 (1999). Reviewer: Ján Plesník (Bratislava) MSC: 05C12 05C05 05C35 PDFBibTeX XMLCite \textit{I. Tomescu}, Discrete Appl. Math. 98, No. 1--2, 159--163 (1999; Zbl 0936.05038) Full Text: DOI
Harutyunyan, Hovhannes A.; Liestman, Arthur L. More broadcast graphs. (English) Zbl 0936.05059 Discrete Appl. Math. 98, No. 1-2, 81-102 (1999). Reviewer: P.Horák (Safat) MSC: 05C35 PDFBibTeX XMLCite \textit{H. A. Harutyunyan} and \textit{A. L. Liestman}, Discrete Appl. Math. 98, No. 1--2, 81--102 (1999; Zbl 0936.05059) Full Text: DOI
Chartrand, Gary; Zhang, Ping Realizable ratios in graph theory: Geodesic parameters. (English) Zbl 0955.05057 Bull. Inst. Comb. Appl. 27, 69-80 (1999). Reviewer: Herman J.Servatius (Worcester) MSC: 05C35 PDFBibTeX XMLCite \textit{G. Chartrand} and \textit{P. Zhang}, Bull. Inst. Comb. Appl. 27, 69--80 (1999; Zbl 0955.05057)
Averbakh, Igor; Berman, Oded Algorithms for path medi-centers of a tree. (English) Zbl 0967.90064 Comput. Oper. Res. 26, No. 14, 1395-1409 (1999). MSC: 90B80 90B50 05C35 PDFBibTeX XMLCite \textit{I. Averbakh} and \textit{O. Berman}, Comput. Oper. Res. 26, No. 14, 1395--1409 (1999; Zbl 0967.90064) Full Text: DOI
Ahlswede, Rudolf; Cai, Ning A counterexample to Kleitman’s conjecture concerning an edge-isoperimetric problem. (English) Zbl 0941.05063 Comb. Probab. Comput. 8, No. 4, 301-305 (1999). Reviewer: P.L.Erdős (Budapest) MSC: 05D05 05C35 PDFBibTeX XMLCite \textit{R. Ahlswede} and \textit{N. Cai}, Comb. Probab. Comput. 8, No. 4, 301--305 (1999; Zbl 0941.05063) Full Text: DOI
Chung, Fan; Delorme, Charles; Solé, Patrick Multidiameters and multiplicities. (English) Zbl 0937.05037 Eur. J. Comb. 20, No. 7, 629-640 (1999). MSC: 05C12 05C35 05C50 05C70 94B05 94B65 PDFBibTeX XMLCite \textit{F. Chung} et al., Eur. J. Comb. 20, No. 7, 629--640 (1999; Zbl 0937.05037) Full Text: DOI Link
Bodlaender, Hans L. A note on domino treewidth. (English) Zbl 0930.05054 Discrete Math. Theor. Comput. Sci. 3, No. 4, 141-150 (1999). MSC: 05C35 05C85 PDFBibTeX XMLCite \textit{H. L. Bodlaender}, Discrete Math. Theor. Comput. Sci. 3, No. 4, 141--150 (1999; Zbl 0930.05054) Full Text: EuDML EMIS
Alabdullatif, M.; Walker, K. Maximum graphs not spannable by \(r\) disjoint paths. (English) Zbl 0935.05056 Discrete Math. 208-209, 9-12 (1999). MSC: 05C35 05C45 05C38 05C75 PDFBibTeX XMLCite \textit{M. Alabdullatif} and \textit{K. Walker}, Discrete Math. 208--209, 9--12 (1999; Zbl 0935.05056) Full Text: DOI
Ogawa, Kenjiro; Tsuchiya, Morimasa On upper bound graphs with respect to line graphs. (English) Zbl 0933.05134 Southeast Asian Bull. Math. 23, No. 2, 265-269 (1999). MSC: 05C75 05C35 PDFBibTeX XMLCite \textit{K. Ogawa} and \textit{M. Tsuchiya}, Southeast Asian Bull. Math. 23, No. 2, 265--269 (1999; Zbl 0933.05134)
Katona, Gyula Y. Properties of edge-tough graphs. (English) Zbl 0931.05067 Graphs Comb. 15, No. 3, 315-325 (1999). Reviewer: Fedor Fomin (St.Peterburg) MSC: 05C70 05C35 05C45 PDFBibTeX XMLCite \textit{G. Y. Katona}, Graphs Comb. 15, No. 3, 315--325 (1999; Zbl 0931.05067) Full Text: DOI
Jendrol’, S.; Voss, H.-J. A local property of large polyhedral maps on compact 2-dimensional manifolds. (English) Zbl 0933.05044 Graphs Comb. 15, No. 3, 303-313 (1999). MSC: 05C10 05C35 05C38 54C25 PDFBibTeX XMLCite \textit{S. Jendrol'} and \textit{H. J. Voss}, Graphs Comb. 15, No. 3, 303--313 (1999; Zbl 0933.05044) Full Text: DOI
Borodin, Oleg V.; Woodall, Douglas R. Cyclic degrees of 3-polytopes. (English) Zbl 0930.05055 Graphs Comb. 15, No. 3, 267-277 (1999). Reviewer: I.Tomescu (Bucureşti) MSC: 05C35 05C15 05C10 51M20 PDFBibTeX XMLCite \textit{O. V. Borodin} and \textit{D. R. Woodall}, Graphs Comb. 15, No. 3, 267--277 (1999; Zbl 0930.05055) Full Text: DOI
Li, Deming; Liu, Yanpei The maximum genus of a 3-regular simplicial graph. (English) Zbl 0945.05017 Appl. Math., Ser. B (Engl. Ed.) 14, No. 2, 203-214 (1999). Reviewer: G.Chaty (Paris) MSC: 05C10 05C35 PDFBibTeX XMLCite \textit{D. Li} and \textit{Y. Liu}, Appl. Math., Ser. B (Engl. Ed.) 14, No. 2, 203--214 (1999; Zbl 0945.05017) Full Text: DOI
Lih, Ko-Wei; Liu, Daphne Der-Fen; Zhu, Xuding Star extremal circulant graphs. (English) Zbl 0935.05042 SIAM J. Discrete Math. 12, No. 4, 491-499 (1999). Reviewer: H.P.Yap (Singapore) MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{K.-W. Lih} et al., SIAM J. Discrete Math. 12, No. 4, 491--499 (1999; Zbl 0935.05042) Full Text: DOI
Enomoto, Hikoe; Miyauchi, Miki Shimabara Embedding graphs into a three page book with \(O(m \log n)\) crossings of edges over the spine. (English) Zbl 0933.05043 SIAM J. Discrete Math. 12, No. 3, 337-341 (1999). Reviewer: Arthur T.White (Kalamazoo) MSC: 05C10 05C35 68R10 PDFBibTeX XMLCite \textit{H. Enomoto} and \textit{M. S. Miyauchi}, SIAM J. Discrete Math. 12, No. 3, 337--341 (1999; Zbl 0933.05043) Full Text: DOI
Jiang, Tao; Mubayi, Dhruv; Shastri, Aditya; West, Douglas B. Edge-bandwidth of graphs. (English) Zbl 0934.05114 SIAM J. Discrete Math. 12, No. 3, 307-316 (1999); encloded correction. Reviewer: H.L.Bodlaender (Utrecht) MSC: 05C78 05C35 PDFBibTeX XMLCite \textit{T. Jiang} et al., SIAM J. Discrete Math. 12, No. 3, 307--316 (1999; Zbl 0934.05114) Full Text: DOI arXiv
Balogh, József; Pluhár, András A sharp edge bound on the interval number of a graph. (English) Zbl 0930.05067 J. Graph Theory 32, No. 2, 153-159 (1999). Reviewer: W.G.Brown (Montreal) MSC: 05C62 05C35 PDFBibTeX XMLCite \textit{J. Balogh} and \textit{A. Pluhár}, J. Graph Theory 32, No. 2, 153--159 (1999; Zbl 0930.05067) Full Text: DOI
He, Xin; Chen, Zhi-Zhong An algorithm for shortest paths in bipartite digraphs with concave weight matrices and its applications. (English) Zbl 0943.68078 SIAM J. Comput. 29, No. 1, 65-80 (1999). MSC: 68Q25 68R10 05C85 05C20 05C35 05C38 PDFBibTeX XMLCite \textit{X. He} and \textit{Z.-Z. Chen}, SIAM J. Comput. 29, No. 1, 65--80 (1999; Zbl 0943.68078) Full Text: DOI
Alon, Noga; Hamburger, Peter; Kostochka, Alexandr V. Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs. (English) Zbl 0935.05053 Eur. J. Comb. 20, No. 6, 469-481 (1999). Reviewer: R.C.Entringer (Albuquerque) MSC: 05C35 05C40 PDFBibTeX XMLCite \textit{N. Alon} et al., Eur. J. Comb. 20, No. 6, 469--481 (1999; Zbl 0935.05053) Full Text: DOI
Bollobás, Béla Turán’s theorem and maximal degrees. (English) Zbl 0930.05056 J. Comb. Theory, Ser. B 75, No. 1, 160-164 (1999). Reviewer: Béla Bollobás (Cambridge) MSC: 05C35 05C75 PDFBibTeX XMLCite \textit{B. Bollobás}, J. Comb. Theory, Ser. B 75, No. 1, 160--164 (1999; Zbl 0930.05056) Full Text: DOI
Alon, Noga; Rónyai, Lajos; Szabó, Tibor Norm-graphs: Variations and applications. (English) Zbl 0935.05054 J. Comb. Theory, Ser. B 76, No. 2, 280-290 (1999). Reviewer: B.K.Dass (Delhi) MSC: 05C35 05C15 PDFBibTeX XMLCite \textit{N. Alon} et al., J. Comb. Theory, Ser. B 76, No. 2, 280--290 (1999; Zbl 0935.05054) Full Text: DOI Link
Randerath, Bert; Volkmann, Lutz Characterization of graphs with equal domination and matching number. (English) Zbl 0940.05058 Util. Math. 55, 65-72 (1999). MSC: 05C75 05C69 05C70 05C35 PDFBibTeX XMLCite \textit{B. Randerath} and \textit{L. Volkmann}, Util. Math. 55, 65--72 (1999; Zbl 0940.05058)
Pach, János Geometric graph theory. (English) Zbl 0931.05024 Lamb, John D. (ed.) et al., Surveys in combinatorics, 1999. Proceedings of the 17th British combinatorial conference, University of Kent at Canterbury, UK, 1999. Cambridge: Cambridge University Press. Lond. Math. Soc. Lect. Note Ser. 267, 167-200 (1999). Reviewer: Carl Droms (Harrisonburg) MSC: 05C10 05C65 05C35 05C55 68U05 PDFBibTeX XMLCite \textit{J. Pach}, Lond. Math. Soc. Lect. Note Ser. 267, 167--200 (1999; Zbl 0931.05024)
Bálint, Vojtech Objects determined by \(n\) points. (English) Zbl 0957.52005 Bálint, V. (ed.), Proceedings of the international scientific conference on mathematics, Žilina, Slovakia, June 30-July 3, 1998. Vol. II. Žilina: EDIS, Žilina University Publisher. 13-18 (1999). Reviewer: Erhard Quaisser (Potsdam) MSC: 52C10 52-02 52C35 05C35 PDFBibTeX XMLCite \textit{V. Bálint}, in: Proceedings of the international scientific conference of mathematics, Žilina, Slovakia, June 30--July 3, 1998. Vol. II. Žilina: EDIS, Žilina University Publisher. 13--18 (1999; Zbl 0957.52005)
Trotter, William T. Ramsey theory and partially ordered sets. (English) Zbl 0930.06006 Graham, Ronald L. (ed.) et al., Contemporary trends in discrete mathematics. From DIMACS and DIMATIA to the future. Proceedings of the DIMATIA-DIMACS conference, Štiřín Castle, Czech Republic, May 19–25, 1997. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 49, 337-347 (1999). MSC: 06A07 05D10 05C35 PDFBibTeX XMLCite \textit{W. T. Trotter}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 49, 337--347 (1999; Zbl 0930.06006)