Adobe PDF
(272.16 kB)
| Title Details: | |
|
Graph Colouring |
|
| Authors: |
Nikolopoulos, Stavros, (ed.), (tr.) Manolopoulos, Ioannis, (ed.), (tr.) |
| Description: | |
| Abstract: |
The Vizing theorem is presented. A graph is bipartite if and only if it does not contain an odd cycle. Also, the Ramsey's theorem is given. A graph is bipartite if and only if it is 2-colorable. In addition, Brooks theorem, Petersen graph, Strong Perfect Graph Theorem are presented.
|
| Linguistic Editors: |
Oxenkioun, Eleni Elissavet |
| Technical Editors: |
Karatzidis, Dimitrios |
| Type: |
Chapter |
| Creation Date: | 28-06-2024 |
| Item Details: | |
| License: |
Attribution - NonCommercial - ShareAlike 4.0 International (CC BY-NC-SA 4.0) |
| Handle | http://hdl.handle.net/11419/13655 |
| Bibliographic Reference: | Nikolopoulos, S., & Manolopoulos, I. (2024). Graph Colouring [Chapter]. In Nikolopoulos, S., & Manolopoulos, I. 2024. Combinatorics [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/13655 |
| Language: |
Greek |
| Is Part of: |
Combinatorics |
| Publication Origin: |
Kallipos, Open Academic Editions |