1. Linear colorings of graphsClaire Hilaire, Matjaž Krnc, Martin Milanič, Jean-Florent Raymond, 2026, original scientific article Abstract: Motivated by algorithmic applications, Kun, O’Brien, Pilipczuk, and Sullivan introduced the parameter linear chromatic number as a relaxation of treedepth and proved that the two parameters are polynomially related. They conjectured that treedepth could be bounded from above by twice the linear chromatic number. In this paper we investigate the properties of linear chromatic number and provide improved bounds in several graph classes.
Keywords: linear coloring, central coloring, treedepth
Published in RUP: 25.03.2026; Views: 488; Downloads: 3
 Full text (713,67 KB)
This document has more files! More... |
2. |
3. |
4. |
5. Proceedings of the 2019 6th Student Computer Science Research Conference - StuCoSReC2019, proceedings of peer-reviewed scientific conference contributions (international and foreign conferences) Abstract: Computer science is now among the most popular study programmes worldwide. We live in a digital age where most industries rely on data and software programmes. From transport infrastructure to public health systems, banking and communications, computer science is everywhere. Technology has made the world better, faster, and more connected. However, it is easy to miss an important component of this exciting success story. Such development was made possible thanks to the brilliant minds of IT graduates, who took their passion for technology and used it to create ground breaking gadgets and computer programmes. Here in Slovenia, the three public universities share these values and invest heavily in their computer science students. These efforts facilitate collaboration among our departments, resulting in joint events such as this StuCoSRec student conference.
Keywords: algoritmi, podatkovne strukture, podatkovne baze, informatika
Published in RUP: 07.11.2021; Views: 2978; Downloads: 63
Full text (12,98 MB) |
6. The recognition problem of graph search trees read moreJesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaž Krnc, Nevena Pivač, Robert Scheffler, Martin Strehler, 2021, original scientific article Keywords: search tree recognition, LBFS, LDFS, MNS, MCS, chordal graphs
Published in RUP: 18.10.2021; Views: 4542; Downloads: 33
 Link to full text |
7. |
8. |
9. |
10. Edge elimination and weighted graph classesJesse Beisegel, Nina Chiarelli, Ekkehard Köhler, Matjaž Krnc, Martin Milanič, Nevena Pivač, Robert Scheffler, Martin Strehler, 2020, published scientific conference contribution Keywords: edge elimination, weighted graph, split graph, threshold graph, chain graph, linear-time recognition algorithm
Published in RUP: 10.11.2020; Views: 3662; Downloads: 39
Link to full text |
