Projects funded by the NCN
Colorings, cliques, and independent sets in graph classes
2019/34/E/ST6/00443
Keywords:
graph coloring χ-boundedness maximum independent set P_t-free graphs geometric representations
Descriptors:
- ST6_4: Formal methods, foundations of computer science, including theoretical computer science, quantum algorithms
- ST6_6: Algorithms, parallel, distributed and network algorithms, algorithmic game theory
- ST1_14: Discrete mathematics and combinatorics
Panel:
ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems
Host institution :
Uniwersytet Jagielloński, Wydział Matematyki i Informatyki
woj. małopolskie
Principal investigator (from the host institution):
Number of co-investigators in the project: 5
Call: SONATA BIS 9 - announced on 2019-06-17
Amount awarded: 2 251 481 PLN
Project start date (Y-m-d): 2020-04-10
Project end date (Y-m-d): 2025-04-09
Project duration:: 60 months (the same as in the proposal)
Project status: Pending project
Project description
Download the project description in a pdf file
Note - project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.