References

[1] Combinatoire graphes et algebre. Monton and Gauthier-Villars, TheHague, 1973.

[2] Combinatorics, graphs and algebra. Monton and Gauthier-Villars, TheHague, 1976.

[3] K. Aardal, G. L. Nemhauser, and R. Weismantel. Discrete Optimization. STOPElsevier, Amsterdam, 2005.

[4] S.A. Abramow, M.I. Mariniczew, and P.D. Polakow. Metody analizysieciowej w planowaniu i zarzadzaniu. Wydawnictwo Ministerstwa ObronyNarodowej, Warszawa, 1967.

[5] N. Abramson. Teoria informacji i kodowania. PWN, Warszawa, 1969.

[6] C. C. Adams. The Knot Book. AMS, 2004.

[7] M. Aigner. Kombinatorik. Teil I: Grundlagen und Zähltheorie. Springer,Berlin, 1975.

[8] M. Aigner. Kombinatorik. Teil II: Matroide und Transversaltheorie.Springer, Berlin, 1976.

[9] M. Aigner. Higher Combinatorics. Dordrecht, 1977.

[10] M. Aigner. Kombinatornaja teorija. Mir, Moskva, 1982.

[11] M. Aigner. Combinatorial Theory. Springer, Berlin, 1997.

[12] M. Aigner and G. M. Ziegler. Dowody z ksiegi. PWN, Warszawa, 2002.

[13] M. Aigner and G. M. Ziegler. Proofs from the book. Springer, Berlin, IVedition, 2010.

[14] Y. Alavi. Graph Theory and Applications. Proceedings of the Conference at STOPWestern Michigan University, May 10-13, 1972. Springer-Verlag, Berlin,1972.

[15] Y. Alavi. Theory and Applications of Graphs.Proceedings,Michigan, May11-15, 1976. Springer-Verlag, Berlin-Heidelberg, 1978.

[16] Y. Alavi, G. Chartrand, L. Lesniak, D. R. Lick, and C. E. Wall. Graphtheory with applications to algorithms and computer science. John WileyAnd Sons Inc., New York, 1985.

[17] J. M. Aldous and R. J. Wilson. Graphs and Applications. An introductory STOPapproach. Springer, London, 2000.

[18] V. V. Alekseev, G. P. Gavrilov, and Sapoºenk. Teorija grafov. Mir,Moskva, 1974.

1

[19] Z. Aª�erowa. Matematicieskoje obiesliecienje ekonomicieskich rascietow zizpalzowaniem teorii grafow. Statistika, Moskwa, 1974.

[20] Z. Aª�erowa. Teoria algorytmów. Pa«stwowe Wydawnictwa Ekonomiczne,Warszawa, 1977.

[21] Z. Aª�erowa and W. Jez»ewa. Zastosowanie teorii grafów. Pa«stwoweWydawnictwa Ekonomiczne, Warszawa, 1974.

[22] J. L. R. Alfonsin. The Diophantine Frobenius Problem. Oxford UniversityPress, 2005.

[23] R.B.J.T. Allenby and A. Slomson. How to count. An introduction tocombinatorics. CRC, Boca Raton, II edition, 2011.

[24] B. Andrásfai. Introductory Graph Theory. Akadémiai Kiadó, Budapest, STOP1977.

[25] G.E. Andrews. The Theory of Partitions. Addison - Wesley, Reading,USA, 1976.

[26] M. Arczy«ski. Graphs, hypergraphs and block systems. Zielona Gøra, 1976.

[27] A. Baker, B. Bollobás, and A. Hajnal. A tribute to Paul Erdös. CambridgeUniversity Press, Cambridge, I edition, 1990.

[28] L. Banachowski, A. Kreczmar, and W. Rytter. Analiza algorytmów istruktur danych. Wydawnictwa Naukowo-Techniczne, Warszawa, 1987.

[29] A.J. Banarski. Równania nieoznaczone, uªamki ªa«cuchowe, kombinato-ryka, dwumian Newtona. PZWS, Warszawa, 1959.

[30] J. Bang-Jensen and G. Gutin. Digraphs - Theory, Algorithms and Appli- STOPcations. Springer-Verlag, London, 2001.

[31] J. Bang-Jensen and G. Gutin. Digraphs - Theory, Algorithms and Appli-cations. Springer-Verlag, London, II edition, 2009.

[32] E. Bannai and T. Ito. Algebran£eskaja kombinatorika. Schemy otno²enuj.Mir, Moskva, 1987.

[33] W. I. Baranow and B. S. Steckin. Ekstremalnyje kombinatornyje zadaci iich prilozenija. Nauka, Moskwa, 1989.

[34] R. A. Bari and F. Harary. Graphs and Combinatorics. Proceedings of STOPthe Capital Conference on Graph Theory and Combinatorics at the G.Washington University, June 18-22, 1973. Springer, Berlin, 1974.

[35] R. Basaker and T. Saatu. Kone£nye grafy seti. Nauka, Moskva, 1974.

[36] L.D. Baumert. Cyclic Di�erence Sets. Springer-Verlag, Berlin, 1971.

2

[37] M. Behzad and G. Chartrand. Introduction to the Theory of Graphs. Allyn STOPand Bacon Inc., Boston, 1971.

[38] È. Bekkenbach. Prikladnaja kombinatornaja matematika. Izdatel'stvo”Mir”, Moskva, 1968.

[39] R. Bellman, K. L. Cooke, and J. A. Lockett. Algorithms, Graphs andComputers. Academic Press, New York and London, 1970.

[40] V.V. Belov, E.M. Vorob'ev, and V.E. Satalov. Teorija grafov. ”VyssajaSkola”, Moskva, 1976.

[41] V.E. Bene². Mathematical theory of connecting networks and telephonetra�c. Academic Press, New York, 1965.

[42] A. Berdon. Geometrija diskretnych grupp. Izdatel'stvo ”Nauka”, Moskva,1986.

[43] C. Berge. Teorija grafov i ee primenenija. Izdat. Inosr. Lit., Moskva, 1962.

[44] C. Berge. The Theory of Graphs and its Applications. Methuen and Co.Ltd, London, 1966.

[45] C. Berge. Theorie des graphes et ses applications. Dunod, Paris, 1967.

[46] C. Berge. Principes de combinatoire. Dunod, Paris, 1968.

[47] C. Berge. Graphes et hypergraphes. Dunod, Paris, 1970.

[48] C. Berge. Principles of Combinatorics. Academic Press, New York, 1971.

[49] C. Berge. Graphs and hypergraphs. North-Holland, Amsterdam, 1973. STOP

[50] C. Berge. Hypergraphs. Seminar Ohio State University '72. ZAK, Berlin,1974.

[51] T. D. Bieriezniewa. Mikroekonomiczne problemy badan operacyjnych.PWE, Warszawa, 1977.

[52] G. Biess. Graphentheorie. BSB. B. G. Teubner Verlagsgesellschaft,Leipzig, 1976.

[53] E.J. Billington, S. Oates-Williams, and A. Penfold Street. Combinatorialmathematics IX. Springer-Verlag, Berlin, 1982.

[54] J. Bªa»ewicz. Problemy optymalizacji kombinatorycznej - zªo»ono±¢obliczeniowa, algorytmy aproksymacyjne. PWN, Warszawa-�ód¹, 1986.

[55] A.S. Bloch. Graf - schemy i ich primenenie. ”Vysèjsaja Skola”, Minsk,1975.

[56] A.S. Bloch. Graf - schemy i algoritmy. ”Vysèjsaja Skola”, Minsk, 1987.

3

[57] K.P. Bogart. Discrete mathematics. D.C. Heath and Company, Lexington,1988.

[58] F. Böhm and G. Weise. Graphen in der Datenverarbeitung. VEB Fach-buchverlag, Leipzig, 1981.

[59] B. Bollobás. Advances in Graph Theory. North-Holland Publishing Com- STOPpany, Amsterdam, 1978.

[60] B. Bollobás. Modern Graph Theory. Springer, New York, 1998. STOP

[61] B. Bollobás. Random graphs. Cambridge University Press, Cambridge, II STOPedition, 2001.

[62] B. Bollobás. Extremal graph theory. Dover Publications, New York, 2004. STOP

[63] W.G. Boªtianski. Sterowanie optymalne ukªadami dyskretnymi.Wydawnictwa Naukowo - Techniczne, Warszawa, 1978.

[64] V. G. Boltianskij and P. S. Soltan. Kombinatornaja geometrija razlicznychklassow wypuklych mnozestw. Izdatelstwo Sztinca, Kiszyniew, 1978.

[65] V. G. Boltjanskij. Optimal'noe upravlenie diskretnymi sistemami. Izda-tel'stvo ”Nauka”, Moskva, 1973.

[66] V. Boltyanski, H. Martini, and P.S. Soltan. Excursions into combinatorialgeometry. Springer-Verlag, Berlin-Heidelberg, 1997.

[67] J. A. Bondy and U. S. R. Murty. Graph Theory. Springer, 2008. STOP

[68] J.H. Borwein and A.S. Lewis. Convex analysis and nonlinear optimization:theory and examples. Springer-Verlag, New York, 2000.

[69] R. P. Brent. Algorithms for Minimization Without Derivatives. PrenticeHall, New Jersey, 1973.

[70] S. F. Briancew and M. A. Siljajew. Prilazenije matric i grafow k analizuustrojstw. Izdatelstwo Sowietskoje radjo, Moskwa, 1970.

[71] J. Bromirski. Teoria automatów. WNT, Warszawa, 1969.

[72] J. Brown and D. Sherbert. Methods of Finite Mathematics. Wiley, NewYork, 1989.

[73] R. Brown and B. Brown. Finite Mathematics. Ardsley House Pub., NewYork, 1992.

[74] R.A. Brualdi. Introductory Combinatorics. Elsevier North - Holland, NewYork, 1977.

[75] R.A. Brualdi. Introductory Combinatorics. Prentice Hall, New Jersey, III STOPedition, 1999.

4

[76] R.A. Brualdi and D. Cvetkovi£. A combinatorial approach to matrix theoryand its applications. CRC Press, Boca Raton, 2009.

[77] V. Bryant. Aspekty kombinatoryki. Wydawnictwa Naukowo-Techniczne, STOPWarszawa, 1997.

[78] P.J. Cameron. Combinatorial surveys: proceedings of the sixth british STOPcombinatorial conference. Academic Press, London, 1977.

[79] P.J. Cameron and J.H. Lint. Teorija grafov. Teorija kodirovanija i blok-schemy. Izdatel'stvo ”Nauka”, Moskva, 1980.

[80] P.J. Cameron and J.H. Lint. Designs, graphs, codes and their links. Cam-bridge University Press, 1991.

[81] M. D. Canon, C. D. Cullum, and E. Polak. Sterowanie optymalne i pro-gramowanie matematyczne. WNT, Warszawa, 1975.

[82] M. Capobianco, J. B. Frecken, and M. Krolik. Recent trends in graphtheory, Proceedings of the First New York City Graph Theory Conferenceheld on June 11-13, 1970. Springer-Verlag, Berlin-Heidelberg, 1971.

[83] P. Cartier and D. Foata. Problèmes combinatoires de commutation etrèarrangements. Springer-Verlag, Berlin-Heidelberg, 1969.

[84] L. R. A. Casse and W. D. Wallis. Combinatorial Mathematics IV, Proceed-ings of the 4. Australian Conference, held at the University of Adelaide,August 27-29, 1975. Springer-Verlag, Berlin-Heidelberg, 1976.

[85] G. Chartrand, L. Lesniak, and P. Zhang. Graphs and digraphs. CRC,Boca Raton, V edition, 2011.

[86] G. Chartrand and P. Zhang. Chromatic Graph Theory. CRC, Boca Raton, STOP2009.

[87] W. Chen. Applied Graph Theory. North-Holland, Amsterdam, 1971.

[88] W. Chen. Applied graph theory. Graphs and electrical networks. North- STOPHolland Publishing Company, Amsterdam, 1976.

[89] C.W. Churchman, R.L. Acko�, and B.L. Arno�. Operations research.Verlag Die Wirtschaft, Berlin, 1966.

[90] C.J. Colbourn and J.H. Dinitz. The CRC Handbook of Combinatorial STOPDesigns. CRC Press, Boca Raton, 1996.

[91] A.J.T. Colin. Wst¦p do systemów operacyjnych. Pa«stwowe WydawnictwoNaukowe, Warszawa, 1976.

[92] P. Compoint. Les graphes en recherche operationnelle.Ensembles remar-quables et algorithmes de tatonnement. Dunod, Paris, 1972.

5

[93] L. Comtet. Analyse combinatoire, volume I. Universitaires de Frances,Paris, 1970.

[94] L. Comtet. Analyse combinatoire, volume II. Universitaires de Frances,Paris, 1970.

[95] J.H. Conway and R. Guy. Ksi¦ga liczb. Wydawnictwa Naukowo - Tech-niczne, Warszawa, 1999.

[96] W. Cook, W.H. Cunningham, W.R. Pulleyblank, and A. Schrijver. Com-binatorial optimization. John Wiley & Sons Inc., New York, 1998.

[97] T.H. Cormen, Ch.E. Leiserson, and R.L.Rivest. Wprowadzenie do algo- STOPrytmów. Wydawnictwa Naukowo-Techniczne, Warszawa, II edition, 1998.

[98] G. Cornuejols. Combinatorial Optimization. Packing and coverings. SIAMPhiladelphia, 2001.

[99] D. Cox, J. Little, and D. O'Shea. Ideals, varieties, and algorithms.Springer, New York, 1997.

[100] H.S.M. Coxeter and W.O.J. Moser. Generators and Relations for DiscreteGroups. Springer-Verlag, Berlin-Heidelberg, III edition, 1972.

[101] P. Cromwell. Knots and links. Cambridge University Press, 2004.

[102] H.M. Cundy and A.P. Rollett. Modele matematyczne. PWN, Warszawa,1967.

[103] D. M. Cvetkovi¢, M. Doob, and H. Sachs. Spectra of Graphs - Theory and STOPApplication. VEB Deutsche Verlag der Wissenschaften, Berlin, II edition,1982.

[104] D.M. Cvetkovi¢, P. Rowlinson, and S. Simi¢. Eigenspaces of graphs. Cam-bridge University Press, Cambridge, 1997.

[105] S. Dasgupta, Ch. Papadimitriou, and U. Vazirani. Algorytmy. PWN,Warszawa, 2010.

[106] J. Demetrovics, G. Katona, and A. Salomaa. Algebra, combinatorics andlogic in computer science, volume I. Bolyai János Matemtikai Társulat,Budapest, 1986.

[107] J. Demetrovics, G. Katona, and A. Salomaa. Algebra, combinatorics andlogic in computer science, volume II. Bolyai János Matemtikai Társulat,Budapest, 1986.

[108] J. Dénes and A.D. Keedwell. Latin squares and their applications.Akadémiai Kiadó, Budapest, I edition, 1974.

[109] N. Deo. Teoria grafów i jej zastosowania w technice, informatyce. Pa«st- STOPwowe Wydawnictwo Naukowe, Warszawa, 1980.

6

[110] R. Diestel. Graph Theory. Springer, New York, 1997. STOP

[111] R. Diestel. Graph theory. Springer-Verlag, New York, II edition, 2000. STOP

[112] R. Diestel. Graph theory. Springer-Verlag, Berlin, III edition, 2005.

[113] R. Diestel. Graph theory. Springer-Verlag, Heidelberg, IV edition, 2010. STOP

[114] A. Dold and B. Eckmann. Hypergraph seminar. Springer-Verlag, Berlin-Heidelberg, 1974.

[115] R. Dorfman, P.A. Samuelson, and R.M. Solow. Linear programming andeconomic analysis. McGraw-Hill Book Company Inc., New York, 1958.

[116] S. N. Dorogovtsev and J. F. F. Mendes. Evolution of Networks. OxfordUniversity Press, New York, 2003.

[117] W. Dück and M. Bliefernich. Operationsforschung: Mathematische grund-lagen methoden und modelle, volume II. VEB Deutscher Verlag der Wis-senschaften, Berlin, 1972.

[118] W. Dück and M. Bliefernich. Operationsforschung: Mathematische grund-lagen methoden und modelle, volume III. VEB Deutscher Verlag der Wis-senschaften, Berlin, 1973.

[119] R. A. Dunlap. The golden ratio and Fibonacci numbers. World Scienti�c,Singapore, 1997.

[120] J.G. Ecker and M. Kupferschmid. Introduction to Operations Research.John Wiley & Sons Inc., New York, 1988.

[121] P. Ehrensperger. Moderne mathematik: kombinatorik. Verlag ModerneIndustrie, München, 1973.

[122] M. Eisen. Elementary combinatorial analysis. Gordon and Breach, SciencePublishers Inc., New York, 1969.

[123] W. A. Emeliciew, M. M. Kowaliew, and M. K. Krawcow. Mnogogranniki,grafy, optimizacija. Nauka, Moskwa, 1981.

[124] K. Engel. Sperner theory. Cambridge University Press, New York, 1997.

[125] K. Engel and H-D.O.F. Gronau. Sperner Theory in Partially Ordered Sets.BSB. B. G. Teubner Verlagsgesellschaft, Leipzig, 1985.

[126] P. Erdös, A. Hajnal, A. Máté, and R. Rado. Combinatorial set theory: STOPpartition relations for cardinals. Akadémiai Kiadó, Budapest, 1984.

[127] P. Erdös and G. Katona. Theory of graphs. Proceedings of the colloquiumheld at Tihany, Hungary Sep. 1966. Akademiai Kiado, Budapest, 1968.

7

[128] P. Erdös, A. Rényi, and V.T. Sós. Combinatorial theory and its applica- STOPtions, volume I. Bolyai János Matemtikai Társulat, Budapest, 1970.

[129] P. Erdös, A. Rényi, and V.T. Sós. Combinatorial theory and its applica- STOPtions, volume II. Bolyai János Matemtikai Társulat, Budapest, 1970.

[130] P. Erdös and J. Spencer. Probabilistic Methods in Combinatorics. STOPAkademia Kiadó, Budapest, 1974.

[131] I.I. Ezov, A.V. Skorochod, and M.I. Jadrenko. Èlementy kombinatoriki.Izdatel'stvo ”Nauka”, Moskva, 1977.

[132] R. Faure, J.P. Boss, and A. Le Gar�. Badania operacyjne. Pa«stwoweWydawnictwo Naukowe, Warszawa, 1982.

[133] R.O. Ferguson and L.F. Sargent. Linear programming. McGraw-Hill BookCompany Inc., New York, 1958.

[134] L.P. Fibonacci. The book of squares. Academic Press Inc., San Diego,1987.

[135] M. Fiedler. Recent advances in graph theory.Proceedings of the Symposiumheld in Prague, June 1974. Academia, Praha, 1975.

[136] M. Fiedler. Graphs and other combinatorial topics - proceedings of the STOPThird Czechoslovak Symposium on Graph Theory, held in Prague, August24th to 27th 1982. BSB. B. G. Teubner Verlagsgesellschaft, Leipzig, 1983.

[137] H. Fisher and J. Piehler. Modellsysteme der Operationsforschung. EinBetrag zur Theorie. Academie-Verlag, Berlin, 1974.

[138] J. Flachsmeger. Kombinatoryka - podstawowy wykªad w uj¦ciu mnogo±-ciowym. Pa«stwowe Wydawnictwo Naukowe, Warszawa, I edition, 1974.

[139] J. Flachsmeger. Kombinatoryka - podstawowy wykªad w uj¦ciu mnogo±-ciowym. Pa«stwowe Wydawnictwo Naukowe, Warszawa, II edition, 1977.

[140] J. Flachsmeyer. Kombinatorik. Deutscher Verlag der Wissenschaften,Berlin, 1970.

[141] P. Flajolet and R. Sedgewick. Analytic Combinatorics. Cambridge Uni-versity Press, Cambridge, 2009.

[142] D. Foata. Combinatoire et Representation du Groupe Symetrique. Actes dela Table Ronde du C.N.R.S. tenue a'l'Universite Louis-Pasteur de Stras-bourg, 26 au 30 avril 1976. Springer-Verlag, Berlin-Heidelberg, 1977.

[143] L.R. Ford and D.R. Fulkerson. Przepªywy w sieciach. Pa«stwoweWydawnictwo Naukowe, Warszawa, 1969.

[144] T. Fort. Finite di�erences and di�erence equations in the real domain.Oxford at the Clarendon Press, 1948.

8

[145] A. A. Fridman. Issledovanja po diskretnoj matematike. Nauka, Moskva,1973.

[146] W. D. Furakob. Ustoj£uvocti u stabilizacija diskretnych processov. Nauka,Moskva, 1982.

[147] H. Furstenberg. Recurrence in ergodic theory and combinatorial numbertheory. Princeton University Press, Princeton, New Jersey, 1981.

[148] M. R. Garey and D. S. Johnson. Vy£islitel'nye ma²iny i trudnore²aiemyiezadaei. Mir, Moskva, 1982.

[149] R. S. Gar�nkel and G. L. Nemhauser. Programowanie caªkowitoliczbowe.PWN, Warszawa, 1978.

[150] S.I. Gass. Programowanie liniowe. Metody i zastosowania. Pa«stwoweWydawnictwo Naukowe, Warszawa, 1973.

[151] G. P. Gavrilov and A. A. Sapozhenko. Selected problems in Discrete Math-ematics. Mir Publishers, Moskwa, 1989.

[152] C. Godsil. Algebraic Combinatorics. Chapman and Hall, New York, 1993.

[153] C. Godsil and G. Royle. Algebraic Graph Theory. Springer, New York,2004.

[154] M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. 57 volumeof Annals of Discrete Mathematics. Elsevier, II edition, 2004.

[155] M.C. Golumbic and J.B.-A. Hartman. Graph theory, combinatorics and STOPalgorithms, Interdisciplinary Applications. Springer, New York, 2005.

[156] J.E. Goodman and J. O'Rourke. Handbook of Discrete and Computational STOPGeometry. Chapman and Hall / CRC, Boca Raton, 2004.

[157] V. M. Govorov, P.Dybov, N.Miroshin, and S.Smirnova. Problems in Math-ematics with Hints and Solutions. Moscow, 1986.

[158] R.L. Graham, M. Grötschel, and L. Lov±z. Handbook of combinatorics, STOPvolume I. Elsevier Science B.V., Amsterdam, 1995.

[159] R.L. Graham, M. Grötschel, and L. Lov±z. Handbook of combinatorics, STOPvolume II. Elsevier Science B.V., Amsterdam, 1995.

[160] R.L. Graham, D.E. Knuth, and O. Patashnik. Matematyka konkretna. STOPPa«stwowe Wydawnictwo Naukowe, Warszawa, II edition, 1998.

[161] R.L. Graham and J. Nesetril. The mathematics of Paul Erdös, volume I. STOPSpringer-Verlag, Berlin-Heidelberg, 1997.

[162] R.L. Graham and J. Nesetril. The mathematics of Paul Erdös, volume II. STOPSpringer-Verlag, Berlin-Heidelberg, 1997.

9

[163] R.L. Graham, B.L. Rothschid, and J.H. Spencer. Ramsey Theory. Wiley, STOPNew York, 1990.

[164] R. P. Grimaldi. Discrete and Combinatorial Mathematics - An AppliedIntroduction. Addison-Wesley, Reading, 1994.

[165] R. P. Grimaldi. Discrete and Combinatorial Mathematics - An Applied STOPIntroduction. Addison - Wesley Longman, Reading, USA, IV edition, 1999.

[166] R. P. Grimaldi. Discrete and Combinatorial Mathematics - An Applied STOPIntroduction. Addison - Wesley Longman, Reading, USA, V edition, 2004.

[167] R. P. Grimaldi. Student's Solutions Manual - to accompany Discrete and STOPCombinatorial Mathematics - An Applied Introduction. Addison - WesleyLongman, Reading, USA, 2004.

[168] J. Gross and J. Yellen. Graph theory and its applications. CRC Press, STOPBoca Raton, 1999.

[169] J. Gross and J. Yellen. Handbook of graph theory. CRC Press, Boca Raton, STOP2004.

[170] J. Gross and J. Yellen. Graph theory and its applications. CRC, BocaRaton, II edition, 2006.

[171] I. Grossman and W. Magnus. Gruppen und ihre Graphen. Ernst KlettVerlag, Stuttgart, 1971.

[172] I. Grossman and W. Magnus. Gruppy i ich grafy. Mir, Moskwa, 1971.

[173] I. Grossman and W. Magnus. Les groupes et leurs graphes. Dunod, Paris,1971.

[174] M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms andCombinatorial Optimization. Springer-Verlag, Berlin, 1988.

[175] B. Grünbaum. Etjudy po kombinatornoj geometrii i teorii vypuklych tiel.Izdatel'stvo ”Nauka”, Moskva, 1971.

[176] B. Grünbaum. Convex Polytopes. Springer, New York, II edition, 2003.

[177] J. Grygiel. Wprowadzenie do matematyki dyskretnej. Akademicka O�cynaWydawnicza EXIT, Warszawa, 2007.

[178] R. Guy, H. Hanami, N. Sauer, and J. Schonheim. Combinatorial structuresand their applications. Proceedings of the Calgary International Confer-ence on Combinatorial Structures and Their Applications held at the Uni-versity of Calgary, Calgary, Alberta, Canada, June, 1969. Gordon andBreach, Science Publishers, Inc., New York, 1970.

[179] A. Hajnal, L. Lovasz, and V .T. Sos. Finite and in�nite sets, volume I.Szeged, 1984.

10

[180] A. Hajnal, L. Lovasz, and V .T. Sos. Finite and in�nite sets, volume II.Szeged, 1984.

[181] A. Hajnal and V .T. Sos. Combinatorics, volume 1. North-Holland Pub-lishing Company, Vac, 1978.

[182] A. Hajnal and V .T. Sos. Combinatorics, volume 2. North-Holland Pub-lishing Company, Vac, 1978.

[183] H.R. Halder and W. Heise. Einführung in die Kombinatorik. Carl HanserVerlag, München Wien, 1976.

[184] R. Halin. Graphentheorie. Academie - Verlag, Berlin, 1989.

[185] M. Hall. Kombinatorika. Mir, Moskwa, 1970.

[186] R. Hammack, W. Imrich, and S. Klavºar. Handbook of product graphs.CRC, Boca Raton, II edition, 2011.

[187] D.R. Hankerson. Coding Theory and Cryptography the Essentials. NewYork, 2000.

[188] F. Harary. Graph Theory and Theoretical Physics. Academic Press Inc.,London, 1967.

[189] F. Harary. Proof techniques in graph theory. Proceedings of the SecondAnn Arbor Graph Theory Conference, February 1968. Academic PressInc., New York, 1969.

[190] F. Harary. Graph Theory. Addison - Wesley Longman, Reading, USA, STOP1972.

[191] F. Harary. New Directions in the Theory of Graphs. Academic Press Inc.,New York, 1973.

[192] F. Harary. Teorija grafov. Mir, Moskva, 1973.

[193] F. Harary, R.Z. Norman, and D. Cartwright. Introduction à la théorie desgraphes orientés modèles structuraux. Dunod, Paris, 1968.

[194] F. Harary and E. Palmer. Pere£islenie grafov. Mir, Moskva, 1977.

[195] G.H. Hardy and E.M. Wright. An introduction to the theory of numbers.Oxford at the Clarendon Press, 1960.

[196] B. Harris. Graph Theory and its Applications. Academic Press, New York,1970.

[197] J. M. Harris, J. L. Hirst, and M. J. Mossingho�. Combinatorics and GraphTheory. Springer, New York, 2000.

11

[198] J. M. Harris, J. L. Hirst, and M. J. Mossingho�. Combinatorics and GraphTheory. Springer, New York, II edition, 2008.

[199] R. Henn and O. Moeschlin. Mathematical Economics and Game Theory.Springer, Berlin, 1977.

[200] D. Hilbert. Festshrift David Hilbert zu seinem sechzigsten Geburtstag am23. Januar 1922. Springer, Berlin, 1982.

[201] Ø. Hjelle and M. Dæhlen. Triangulations and Applications. Springer,Berlin, 2006.

[202] A. Hoborski. Wy»sza matematyka (cze±¢ I). Drukarnia UJ, Kraków, 1928.

[203] A. Hoborski. Teoria krzywych (cze±¢ II). Drukarnia UJ, Kraków, 1933.

[204] A. Hoborski. Teoria dwójkowych sum wektorjalnych. Drukarnia UJ,Kraków, 1935.

[205] F. Ho�man, R. B. Levow, and R. S. D. Thomas. Proceedings of the 3-rdSoutheastern Conference on Combinatorics, Graph Theory and Comput-ing. Boca Raton, 1972.

[206] K-H. Ho�man, R. H. W. Hoppe, and V.Schulz. Fast Solution of DiscretizedOptimization Problems. Birhauser, Basel, 2001.

[207] L. Hogben. L'Univers des nombres. Histoire et evolution des mathema-tiques. Senefelder Printing Co, Ltd, Amsterdam, 1962.

[208] D. A. Holton. Combinatorial Mathematics. Proceedings of the SecondAustralian Conference. Springer-Verlag, Berlin-Heidelberg, 1974.

[209] D. A. Holton and J. Sheehan. The Petersen Graph. Cambridge UniversityPress, Cambridge, 1993.

[210] E. Ignasiak. Programowanie sieciowe. Pa«stwowe Wydawnictwo Eko-nomiczne, Warszawa, II edition, 1975.

[211] E. Ignasiak. Teoria grafów i planowanie sieciowe. Pa«stwoweWydawnictwo Ekonomiczne, Warszawa, 1982.

[212] W. Imrich and S. Klavzar. Product graphs: structure and recognition.John Wiley & Sons Inc., New York, 2000.

[213] A. A. Ivanov, M. W. Liebeck, and J. Saxl. Groups, Combinatorics andGeometry. World Scienti�c Publishing, Singapore, 2001.

[214] S. W. Jablonski and O. B. Luponow. Diskrete Mathematik und mathema-tische Fragen der Kybernetik. Akademie-Verlag, Berlin, 1980.

[215] S. V. Jablonskoj and O. B. Lypanov. Diskretnaja matematika u matem-ati£eskye voprosy kibernetiki. Nauka, Moskva, 1974.

12

[216] B. W. Jackson and D. Thoro. Applied Combinatorics with Problem Solv-ing. Addison-Wesley, New York, 1990.

[217] B. Jankowski. Grafy. Algorytmy w Pascalu. ”Mikom”, Warszawa, 1998.

[218] M. Jeger. Einführung in die Kombinatorik. Ernst Klett Verlag, Stutgart,1973.

[219] T. R. Jensen and B. Toft. Graph Coloring Problems. John Wiley andSons, New York, 1995.

[220] Z. J¦drzejczyk, K. Kukuªa, J. Skrzypek, and A. Walkosz. Badania op-eracyjne w przykªadach i zadaniach. Pa«stwowe Wydawnictwo Naukowe,Warszawa, III edition, 2001.

[221] K. L. Johnson. Operations Research. VDI, Düsseldorf, 1973.

[222] S. Jukna. Extremal Combinatorics. Springer, Berlin, 2001.

[223] D. Jungnickel. Graphs, Networks and Algorithms. Springer, Berlin, 1999.

[224] D. Jungnickel. Graphs, Networks and Algorithms. Springer, Berlin, IIIedition, 2008.

[225] S. Karlin. Mathematical methods and theory in games, programming, andeconomics, volume 1. Addison-Wesley Publishing Company, INC, Read-ing, 1959.

[226] S. Karlin. Mathematical methods and theory in games, programming, andeconomics, volume 2. Addison-Wesley Publishing Company, INC, Read-ing, 1959.

[227] K. L. Karmanov. Programmation Mathématique. Mir, Moscou, 1977.

[228] D. Karnopp and R. Rozenberg. Primenenie teorii grafov cvjazej v technike.Mir, Moskva, 1974.

[229] M. Karo«ski. Balanced Subgraphs of Large Random Graphs. WydawnictwoNaukowe Uniwersytetu im. Adama Mickiewicza w Poznaniu, Pozna«,1984.

[230] T. Kasprzak. Badania operacyjne w nowoczesnym zarz¡dzaniu. Pa«st-wowe Wydawnictwo Ekonomiczne, Warszawa, 1974.

[231] T. Kasprzak. Optymalizacja dyskretna. Zastosowania ekonomiczne.Pa«stwowe Wydawnictwa Ekonomiczne, Warszawa, 1984.

[232] A. Kaufmann. Graphs, Dynamic Programming and Finite Games. Aca-demic Press, New York, 1967.

[233] A. Kaufmann. Introduction a la combinatorique en vue des applications.Dunod, Paris, 1968.

13

[234] A. Kaufmann. Einführung in die Graphentheorie. R. Oldenburg,München, 1971.

[235] A. Kaufmann and D. Coster. Exercices de combinatorique avec solutions. STOPTome I: Méthodes de dénombrement. Dunod, Paris, 1969.

[236] A. Kaufmann and D. Coster. Exercices de combinatorique avec solutions. STOPTome II: Propriétés des graphes et méthodes d'énumeration. Dunod, Paris,1970.

[237] A. Kaufmann and D. Coster. Exercices de combinatorique avec solutions. STOPTome III: Méthodes d'optimisation. Dunod, Paris, 1972.

[238] A. Kaufmann and R. Faure. Badania operacyjne na co dzie«. PWN,Warszawa, 1968.

[239] D. E. Knuth. The Art of Computer Programming. Volume I. Addison-Wesley, Reading, 1972.

[240] D. E. Knuth. The Art of Computer Programming. Volume III. Addison-Wesley, Reading, 1973.

[241] N. Koblitz. Algebraiczne aspekty kryptogra�i. Wydawnictwa Naukowo -Techniczne, Warszawa, 2000.

[242] W. Kocay and D.L. Kreher. Graphs, algorithms, and optimization. Chap-man and Hall / CRC, Boca Raton, 2005.

[243] E. Ko�er. Wstep do teorii gier. PZWS, Warszawa, 1963.

[244] G. S. M. Kokseter and U. O. Dº. Mozer. Poroºdaju²£e elementy i opre-deljaju²£e zootno²eja dyskretnych grupp. Nauka, Moskva, 1980.

[245] D. König. Theorie der endlichen und unendlichen Graphen. BSB Teubner,Leipzig, 1986.

[246] J. Koolen, J.H. Kwak, and M.-Y. Xu. Applications of group theory tocombinatorics. CRC Press, London, 2008.

[247] A. A. Korbut and J. J. Finkelsztejn. Programowanie dyskretne. PWN,Warszawa, 1974.

[248] W. Kordecki. Elementy teorii grafów losowych. Wydawnictwo PolitechnikiWrocªawskiej, Wrocªaw, 1976.

[249] B. Korte and J. Vygen. Combinatorial Optimization. Theory and Algo-rithms. Springer, Berlin, II edition, 2002.

[250] B. Korte and J. Vygen. Combinatorial Optimization. Theory and Algo-rithms. Springer, Berlin, III edition, 2006.

14

[251] B. Korte and J. Vygen. Combinatorial Optimization. Theory and Algo- STOPrithms. Springer, Berlin, IV edition, 2008.

[252] B. Korzan. Elementy teorii grafów i sieci. Metody i zastosowania. WNT,Warszawa, 1978.

[253] I. Ko¹niewska. Równania rekurencyjne. PWN, Warszawa, 1972.

[254] J. Kratochvil, M. Goljan, and P. Ku£era. String Graphs. Academia Nakla-datelstvi �eskoslovenské Akademie V¥d, Praha, 1986.

[255] M. Kubale. Optymalizacja dyskretna - modele i metody kolorowaniagrafów. WNT, Warszawa, 2002.

[256] J. L. Kulikowski. Zarys teorii grafów - zastosowania w technice. PWN, STOPWarszawa, 1986.

[257] J. L. Kulikowski, M. Michalewicz, S. V. Yablonski, and Y. I. Zhuravlev.Discrete Mathematics, volume 7 of Banach Center Publications. PWN,Warszawa, 1982.

[258] B. Kummer. Igry na grafach. Mir, Moskwa, 1982.

[259] L. Ku£era. Kombinatorické algoritmy. SNTL - Nakladatelstvi TechnickéLiteratury, Praha, 1983.

[260] O.P. Kuznecov and G.M. Adel'son-Vel'skij. Diskretnaja Matematika dljainzenera. Ènergoatomizdat, Moskva, 1988.

[261] S. K. Lando and A. K. Zvonkin. Graphs on surfaces and their applications.Springer, Berlin, 2004.

[262] F.T. Leighton. Introduction aux algorithmes et architectures parallèles,grilles, arbres, hypercubes. Paris, 1995.

[263] F. Liang-Tseng and W. Chiu-Sen. Diskrietnyj princip maksimuma. Opti-mizacija mnogostupien£atych processow. Mir, Moskwa, 1967.

[264] V. E. Lichten²tejn. Diskretnost' u cly£ajnost' v ékonomiko-matemati£eskich zada£ach. Nauka, Moskva, 1973.

[265] W. Lietzmann. Gdzie tkwi bªad? PZWS, Warszawa, 1958.

[266] J. Lifermann. Les systèmes discrets. Massonet, Paris, 1974.

[267] J. H. Lint. Combinatorial Theory Seminar Eindhoven University of Tech-nology. Springer, Berlin-Heidelberg, 1974.

[268] W. Lipski. Kombinatoryczne aspekty teorii wyszukiwania informacji.PWN, Warszawa, 1975.

[269] W. Lipski. Kombinatoryka dla programistów. WNT, Warszawa, 1989. STOP

15

[270] W. Lipski and W. Marek. Analiza kombinatoryczna. Pa«stwoweWydawnictwo Naukowe, Warszawa, 1986.

[271] L. Lovász and M. D. Plummer. Matching Theory. Akademiai Kiado, STOPBudapest, 1986.

[272] L. Lovász and V. T. Sós. Algebraic Methods in Graph Theory, volume 25 STOPof Colloquia Mathematica Societatis János Bolyai, volume I. Bolyai JánosMatematikai Társulat, Budapest, 1981.

[273] L. Lovász and V. T. Sós. Algebraic Methods in Graph Theory, volume STOP25 of Colloquia Mathematica Societatis János Bolyai, volume II. BolyaiJános Matematikai Társulat, Budapest, 1981.

[274] L. Lovász and C. Szemerédi. Theory of Algorithms, volume 44 of ColloquiaMathematica Societatis János Bolyai. Bolyai János Matematikai Társulat,Budapest, 1985.

[275] D. G. Luenberg. Teoria optymalizacji. PWN, Warszawa, 1974.

[276] R. C. Lyndon and P. E. Schupp. Combinatorial Group Theory. Springer,Berlin, 1977.

[277] W. Magnus, A. Karrass, and D. Solitar. Combinatorial Group Theory:Presentations of Groups in Terms of Generators and Relations. JohnWiley and Sons, New York, 1966.

[278] M. Marchand. Mathematique discrete. De Boeck Universite, Bruksela,1993.

[279] A.A. Markov and B.A. Kusner. Issledovanija po teorii algoritmov i matem-aticeskoj logike, volume II. Vycislitel'nyj lehtr AN SSSR, Moskva, 1976.

[280] Marschall. Applied Graph Theory. John Wiley and Sons, New York, 1971.

[281] J. Matou²ek. Using the Borsuk-Ulam Theorem. Springer, Berlin, 2003.

[282] J. Matou²ek and J. Ne²et°il. Invitation to Discrete Mathematics. OxfordUniversity Press, New York, 2009.

[283] McDonough and V. C. Mavron. Combinatorics - the proceedings of the STOPBritish Combinatorial Conference held in the University College of Wales,Aberystwyth, 2-6 July 1973. Cambridge University Press, Cambridge,1974.

[284] T.A. McKee and F.R. McMorris. Topics in intersection graph theory.Society for Industrial and Applied Mathematics, Philadelphia, 1999.

[285] A.N. Melichov, L.S. Berstejn, and V.M. Kurejcik. Primenenie grafov dljaproektirovanija diskretnych ustrojstv. Izdatel'stvo ”Nauka”, Moskva, 1974.

16

[286] E. Minieka. Algoritmy optimizacii na sjetach i grafach. Izdatel'stvo ”Mir”, STOPMoskva, 1981.

[287] Mirsky. Studies in Pure Mathematics. Papers in Combinatorial Theory,Analysis, Geometry, Algebra, and Theory of Numbers presented to RichardRedo. Academic Press, London, 1971.

[288] G.H. Mitchell. Badania operacyjne, metody i przykªady. WydawnictwaNaukowo-Techniczne, Warszawa, 1977.

[289] W. Mnich and T. Prucnal. Elementy teorii liczb. WSP, Opole, 1972.

[290] B. Mohar and C. Thomassen. Graphs on Surfaces. The Johns Hopkins STOPUniversity Press, Baltimore, 2001.

[291] M. Molloy and B. Reed. Graph colouring and the probabilistic method.Springer, Berlin, 2002.

[292] P. G. Moore. Wprowadzenie do bada« operacyjnych. WNT, Warszawa,1973.

[293] Y. Muller. Applications pratiques des Graphes a la recherche d'un opti-mum. Editions Eyrolles, Paris, 1972.

[294] N. Nakanishi. Graph Theory and Feynman Integrals, volume 11 of Math-ematics and its Applications. Gordon and Breach, New York, 1971.

[295] W. Narkiewicz. Teoria liczb. Pa«stwowe Wydawnictwo Naukowe,Warszawa, II edition, 1990.

[296] M. J. Necienurjenko. Algoritmy i programmy rieszenja zada£ na grafach isjetach. Nauka, 1990.

[297] G.L. Nemhauser and L. A. Wolsey. Integer and combinatorial optimiza- STOPtion. John Willey and Sons, New York, 1999.

[298] K. Neumann. Operations Research Verfahren. Teil I. Carl Hanser,München, 1975.

[299] K. Neumann. Operations Research Verfahren. Teil III. Carl Hanser,München, 1975.

[300] Nijenhuis and H. S. Wilf. Combinatorial Algorithms. Academic Press,New York, 1975.

[301] H. Noltemeier. Graphen, Algorithmen, Datenstrukturen. Carl Hanser,München, 1976.

[302] H. Noltemeier. Graphentheorie mit Algorithmen und Anwendungen. Wal-ter de Gruyter, Berlin, 1976.

17

[303] F.R. Norris. Discrete structures: an introduction to mathematics for com-puter science. Prentice Hall, Englewood Cli�s, 1985.

[304] I. Nykowski. Programowanie liniowe. Pa«stwowe Wydawnictwo Eko-nomiczne, Warszawa, II edition, 1984.

[305] W. Odyniec and D. Szkudlarski. Matematyka dyskretna - zbiór zada«. STOPWSP, Zielona Góra, 1999.

[306] Z. Opial. Zbiory, formy zdaniowe, relacje. Wydawnictwa Szkolne i Peda-gogiczne, Warszawa, 1976.

[307] O. Ore. Wst¦p do teorii grafów. PWN, Warszawa, 1966.

[308] Z. Palka and A. Ruci«ski. Niekonstruktywne metody matematyki dyskret- STOPnej: metoda probabilistyczna Erdösa i grafy losowe. WNT, Warszawa,1996.

[309] Z. Palka and A. Ruci«ski. Wykªady z kombinatoryki: przeliczanie cz. 1. STOPWNT, Warszawa, 1998.

[310] C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization. Algo-rithms and Complexity. Dover Publications, New York, 1998.

[311] P. M. Pardalos and M. G. C. Resende. Handbook of applied optimization. STOPOxford University Press, New York, 2002.

[312] H.-O. Peitgen, H. Jürgens, and D. Saupe. Granice chaosu. Fraktale. Cz.1. PWN, Warszawa, 1997.

[313] J. Perelman. Ciekawa geometria. PZWS, Warszawa, 1957.

[314] C. F. Picard. Graphes et questionnaires. Tome I: Graphes. Gauthier-Villars, Paris, 1972.

[315] C. F. Picard. Graphes et questionnaires. Tome II: Questionnaires.Gauthier-Villars, Paris, 1972.

[316] Pogoçjan. Adaptacja kombinatornych algoritmov. Izdatel'stvo an armjan-skoj SSR, Jerjevan, 1983.

[317] L.S. Pontriagin. Wstep do topologii kombinatorycznej. PWN, Warszawa,1961.

[318] D.A. Pospieªow. Gry i automaty. WNT, Warszawa, 1968.

[319] C. Postho�, D. Bochmann, and K. Haubold. Diskrete mathematik. BSB.B. G. Teubner Verlagsgesellschaft, Leipzig, 1986.

[320] A. U. Propoj. Jelementy teorii optimal'nych diskretnych processov. Nauka,Moskva, 1973.

18

[321] R. C. Read. Graph Theory and Computing. Academic Press, New York, STOP1972.

[322] E. M. Reingold, J. Nievergelt, and N. Deo. Kombinatornyje algoritmy.Teorija i praktika. Mir, Moskva, 1980.

[323] E. M. Reingold, J. Nievergelt, and N. Deo. Algorytmy kombinatoryczne. STOPPWN, Warszawa, 1985.

[324] H. L. Resniko� and R. O. Wells. Mathematics in Civilization. Holt,Reinhart and Winston, New York, 1972.

[325] J. Riordan. Combinatorial Identities. John Wiley and Sons, New York, STOP1968.

[326] J. Riordan. Kombinatornye tozdestva. Izdatel'stvo ”Nauka”, Moskva, STOP1982.

[327] R.T. Rockafeller. Vypuklyj analiz. Izdatel'stvo ”Mir”, Moskva, 1973.

[328] R.T. Rockafeller. Convex analysis. Princeton University Press, Princeton,1997.

[329] I.W. Romanovskij. Algoritmy resenija jekstremal'nych zadac. Izdatel'stvo”Nauka”, Moskva, 1977.

[330] K. H. Rosen. Handbook of Discrete and Combinatorial Mathematics. CRC STOPPress, Boca Raton, 2000.

[331] K. A. Ross and Ch. R. B. Wright. Matematyka dyskretna. PWN, STOPWarszawa, II edition, 1999.

[332] K. A. Ross and Ch. R. B. Wright. Matematyka dyskretna. PWN, STOPWarszawa, V edition, 2008.

[333] M. Ross. Operational research '72. Proceeding of the Sixth IFORS Inter-national Conference on Operational research. North-Holland, Amsterdam,1973.

[334] B. Roy. Algèbre moderne et théorie des graphes. Tome I: Notions et résul-tats fondamentaux, volume 31 of Finance et économie appliquée. Dunod,Paris, 1969.

[335] K. A. Rybnikov. Vvedenie v kombinatornyj analiz. Izdat. MoskovskogoUniversiteta, Moskva, 1972.

[336] K. A. Rybnikov. Kombinatornyj analiz. Zada£i i upraºnenija. Moskva,1982.

[337] H. Sachs. Einführung in die Theorie der Endlichen Graphen, Teil II.Mathematisch-Naturwissenschaftliche Bibliothek. B. G. Teubner, Leipzig,1972.

19

[338] H. Sachs, H. J. Voss, and H. Walther. Beiträge zur Graphentheorie -Vorgetragen auf dem Internationalen Kolloquium in Manebach vom 9.-12.Mai 1967. B. G. Teubner, Leipzig, 1968.

[339] M Sakarovitch. Optimization combinatoire. Programmation discrete.

[340] M Sakarovitch. Optimization combinatoire. Graphes et programmationlineaire. Paris, 1984.

[341] V. N. Sa£kov. Kombinatornyje metody diskretnoj matematiki. Nauka,Moskva, 1977.

[342] V. N. Sa£kov. Vvedenue v kombinatornye metody diskretnoj matematiki.Nauka, Moskva, 1982.

[343] E. R. Scheinerman. Mathematics - a Discrete Introduction. Thomson,Brooks/Cole, 2006.

[344] A. Schrijver. Theory of linear and integer programming. John Wiley & STOPSons Inc., New York, 2000.

[345] A. Schrijver. Combinatorial Optimization. Polyhedra and E�ciency, vol-ume C. Springer, Berlin, 2003.

[346] A. Schrijver. Combinatorial Optimization. Polyhedra and E�ciency, vol-ume B. Springer, Berlin, 2003.

[347] A. Schrijver. Combinatorial Optimization. Polyhedra and E�ciency, vol-ume A. Springer, Berlin, 2003.

[348] Z. Sea. Optimizacija. Teorija i algoritmy. Izdatel'stvo ”Mir”, Moskva,1973.

[349] J. Sedlá£ek. Einführung in die Graphentheorie. B. G. Teubner, Leipzig,1968.

[350] J. Seidler. Teoria kodów. PWN, Warszawa, 1965.

[351] S. Seszu and M.B. Rid. Linejnye grafy i èlektriceskie cepi. ”Vyssaja Skola”,Moskva, 1971.

[352] W. Sierpi«ski. Teoria liczb. Ministerstwo O±wiaty, Warszawa, III edition,1950.

[353] W. Sierpi«ski. Arytmetyka Teoretyczna. PWN, Warszawa, 1955.

[354] W. Sierpi«ski. Czym si¦ zajmuje teoria liczb. Wiedza Powszechna,Warszawa, 1957.

[355] W. Sierpi«ski. Teoria liczb. Cz. 2. PWN, Warszawa, 1959.

20

[356] W. Sierpi«ski. Co wiemy, a czego nie wiemy o liczbach pierwszych. PZWS,Warszawa, 1961.

[357] W. Sierpi«ski. Liczby trójk¡tne. PZWS, Warszawa, 1962.

[358] W. Sierpi«ski. 250 Problems in Elementary Number Theory. PWN,Warszawa, 1970.

[359] W. Sierpi«ski. Oeuveres choisies. Publ. par S. Hartman et A. Schinzel,volume I. PWN, Warszawa, 1974.

[360] W. Sierpi«ski. Oeuveres choisies. Publ. par S. Hartman et A. Schinzel,volume II. PWN, Warszawa, 1975.

[361] W. Sierpi«ski. Elementary Theory of Numbers. PWN, Warszawa, 1987.

[362] G. G. Sigalov and L. S. Madorskii. Osnolvy teorii diskretnych uprawlenija.Wy²jej²aja ²kola, Minsk, 1973.

[363] M. Simonnard. Linear Programming. Prientice Hall, New Jersey, 1966.

[364] M. Simonnard. Programation linéaire. Techinque du calcul économique.Tome I: Fondements. Dunod, Paris, 1972.

[365] M. Simonnard. Programation linéaire. Techinque du calcul économique.Tome II: Extensions. Dunod, Paris, 1973.

[366] M. Simonnard. Programowanie liniowe. PWN, Warszawa, 1976.

[367] Z. Skupien and M. Borowiecki. Combinatorics and Graph Theory, BanachCenter Publications, vol 25. PWN, Warszawa, 1989.

[368] A. Slomson. An Introduction to Combinatorics. Chapman and Hall/ CRC,Boca Raton, 2000.

[369] A. Soifer. The Mathematical Coloring Book. Springer, New York, 2009. STOP

[370] J. N. Srivastava. A Survey of Combinatorial Theory. North-Holland,Amsterdam, 1973.

[371] P. Stahlknecht. Operations Research. Friedr. Vieweg + Sohn, Braun-schweig, 1970.

[372] D.F. Stanat and D.F. McAllister. Discrete mathematics in computer sci-ence. Prentice Hall, Englewood Cli�s, 1977.

[373] K. Steiglitz. Wst¦p do systemów dyskretnych. WNT, Warszawa, 1977.

[374] H. Steinhaus. Sto zada«. PWN, Warszawa, 1958.

[375] M. N. S. Swamy and K. Thulasiraman. Grafy, sjety i algoritmy. Mir,Moskwa, 1984.

21

[376] R. �witka. Drgania i funkcje wªasne regularnych ukªadów dyskretnych.Tablice warto±ci i funkcji wªasnych równania ró»nicowego ∆4yr−4α2(∆2+6)yr = 0. PWN, Pozna«, 1973.

[377] M.M. Sysªo, N. Deo, and J. S. Kowalik. Algorytmy optymalizacji dyskret-nej z programami w j¦zyku Pascal. Pa«stwowe Wydawnictwo Naukowe,Warszawa, III edition, 1999.

[378] L. Szamkoªowicz. Teoria grafów sko«czonych. Zakªad Narodowy im. Os-soli«skich, Wrocªaw, 1971.

[379] L. Szamkoªowicz. Grafy, hipergrafy, system bloków. Zakªad Narodowy im.Ossoli«skich, Wrocªaw, 1977.

[380] V. A. Sza²kin and E. G. Pytkiejew. Issljedowanja po teorii wypukªychmnozestw i grafow. Uralskij nau£nyj cientr, Svierdlovsk, 1987.

[381] L. Sznirelman. Liczby pierwsze. PWN, Warszawa, 1954.

[382] J. Teghem. Programmation linéaire. Éditions de l'Université de Bruxelles,Bruxelles, 1996.

[383] J. Topp. Domination, independence and irredundance in graphs, Disser-tationes Mathematicae CCCXLII. PAN, Warszawa, 1995.

[384] J.P. Tremblay and R. Manohar. Discrete Mathematical Structures withApplications to Computer Science. MacGraw-Hill, New York, 1975.

[385] W. T. Tutte. Recent Progress in Combinatorics - Proceedings of the Third STOPWaterloo Conference on Combinatorics, May 1968. Academic Press, NewYork, 1969.

[386] J.V. Uspensky and M.A. Heaslet. Elementary Number Theory. McGraw-Hill Book Company, New York, 1939.

[387] B. van der Veen. Wst¦p do teorii badan operacyjnych. PWN, Warszawa,1970.

[388] H.M. Wagner. Badania operacyjne. Zastosowania w zarz¡dzaniu. Pa«st-wowe Wydawnictwo Ekonomiczne, Warszawa, 1980.

[389] W. D. Wallis, A. P. Street, and J. S. Wallis. Combinatorics: RoomSquares, Sum-Free Sets, Hadamard Matrices, volume 292 of Lecture Notesin Mathematics. Springer, Berlin, 1972.

[390] H. Walther and G. Nägler. Graphen, Algorithmen, Programme. VEB,Leipzig, 1987.

[391] H. Walther and H. J. Voss. Über Kreise in Graphen. VEB DeutscherVerlag der Wissenschaften, Berlin, 1974.

22

[392] S. Walukiewicz. Programowanie dyskretne. Pa«stwowe WydawnictwoNaukowe, Warszawa, 1986.

[393] D. J. A. Welsch. Combinatorial Mathematics and Its Applications - pro-ceedings of a conference held at the Mathematical Institute, Oxford, 7-10July, 1969. Academic Press, London, 1971.

[394] D. De Werra. Elèments de programmation linèaire avec application auxgraphes. Presser Polytechniques Romandes, Lausanne, 1990.

[395] D. B. West. Introduction to Graph Theory. Prentice Hall, Upper Sadle STOPRiver, II edition, 2001.

[396] A. T. White. Graphs, Groups and Surfaces, volume 8 of North-HollandMathematics Studies. North-Holland, Amsterdam, 1973.

[397] N. White. Combinatorial Geometries. Cambridge University Press, Cam-bridge, 1987.

[398] S. A. Wiitala. Discrete Mathematics - A Uni�ed Approach. McGraw-Hill,New York, 1987.

[399] N.J. Wilenkin. Kombinatoryka. Pa«stwowe Wydawnictwo Naukowe,Warszawa, 1972.

[400] R. J. Wilson. Introduction to graph theory. Oliver and Boyd, Edinburgh,1972.

[401] R. J. Wilson. Wwiedienje w teoriju grafow. Mir, Moskwa, 1977.

[402] R. J. Wilson. Wprowadzenie do teorii grafów. PWN, Warszawa, 1985. STOP

[403] R. J. Wilson. Wprowadzenie do teorii grafów. PWN, Warszawa, 2008. STOP

[404] I. Winogradow. Elementy teorii liczb. PWN, Warszawa, 1954.

[405] S. Wolfram. A new kind of science. Wolfram Media, Canada, 2002.

[406] L.A. Wolsey. Integer programming. John Willey and Sons, New York,1998.

[407] M. Wo¹niak. Dyfuzja informacji w grafach. AGH, Kraków, 1996.

[408] M. Wo¹niak. Wprowadzenie do problemów komunikacji w grafach. AGH, STOPKraków, 1999.

[409] S. Yablonski. Introduction aux mathématiques discrètes. Mir, Moscou,1983.

[410] S.Y. Yan. Teoria liczb w informatyce. PWN, Warszawa, 2006.

[411] H.P. Yap. Total Colourings of Graphs. Springer-Verlag, Berlin, 1996.

23

[412] N. G. Ze�rov and S. I. Ku£anov. Primenenie teorii grafov w chemii.Nauka, Novosibirsk, 1988.

[413] Ch. Zong. Strange Phenomena in Convex and Discrete Geometry.Springer-Verlag, New York, 1996.

[414] A. A. Zykov. Teorija kone£nych grafov. Nauka, Novosibirsk, 1969. STOP

[415] A.A. Zykov. Osnovy teorii grafov. Izdatel'stvo ”Nauka”, Moskva, 1987. STOP

24