| dc.creator | Galambos Gábor | en_EN |
| dc.creator | Árgilán Viktor | en_EN |
| dc.date | 2011-05-30 | en_EN |
| dc.date.accessioned | 2019-08-08T09:39:47Z | |
| dc.date.available | 2019-08-08T09:39:47Z | |
| dc.identifier.uri | http://dtk.tankonyvtar.hu/xmlui/handle/123456789/3600 | |
| dc.description | Graph theory can be applied to many fields of science. Because of its simplicity it can be easily utilized in solving problems in informatics. This book's aim is to show the deep results and efficient tools behind this simplicity. Only simple mathematical proofs and thoughts are presented which can also be used in the exercises. | en_EN |
| dc.format | SCORM | en_EN |
| dc.language | en | en_EN |
| dc.publisher | Szegedi Tudományegyetem | en_EN |
| dc.rights | Galambos Gábor | en_EN |
| dc.rights | Árgilán Viktor | en_EN |
| dc.subject | Introduction | en_EN |
| dc.subject | Fundamentals | en_EN |
| dc.subject | Hamiltonian Graphs | en_EN |
| dc.subject | Powers of Graphs and Line Graphs | en_EN |
| dc.subject | Matching | en_EN |
| dc.subject | Matching and Factorization | en_EN |
| dc.subject | Decompositions | en_EN |
| dc.subject | Extremal graph theory | en_EN |
| dc.subject | Domination in Graphs | en_EN |
| dc.subject | Ramsey Theory | en_EN |
| dc.subject | gráfelmélet | en_EN |
| dc.subject | faktorizáció | en_EN |
| dc.subject | Ramsey-elmélet | en_EN |
| dc.title | Selected Chapters from the Graph Theory | en_EN |
| dc.type | Text | en_EN |
| dtk.fir | Computer Science and Information Technology | en_EN |
| dtk.oecd | 01. Natural sciences::01.01. Mathematics::01.01.01. Pure mathematics, applied mathematics | en_EN |
| dtk.purchase | TÁMOP-4.1.2.A/1-11/1-2011-0013 Szegedi Tudományegyetem | en_EN |
| dtk.type | elearning | en_EN |
| dtk.udc | ---- MAIN TABLES::0 SCIENCE AND KNOWLEDGE. ORGANIZATION. COMPUTER SCIENCE. INFORMATION. DOCUMENTATION. LIBRARIANSHIP. INSTITUTIONS. PUBLICATIONS::005 Management::51 Mathematics::519.1 Combinatorial analysis. Graph theory | en_EN |
