1. Splittable and unsplittable graphs and configurationsNino Bašić, Jan Grošelj, Branko Grünbaum, Tomaž Pisanski, 2019, original scientific article Abstract: We prove that there exist infinitely many splittable and also infinitely many unsplittable cyclic ▫$(n_3)$▫ configurations. We also present a complete study of trivalent cyclic Haar graphs on at most 60 vertices with respect to splittability. Finally, we show that all cyclic flag-transitive configurations with the exception of the Fano plane and the Möbius-Kantor configuration are splittable.
Keywords: configuration of points and lines, unsplittable configuration, unsplittable graph, independent set, Levi graph, Grünbaum graph, splitting type, cyclic Haar graph
Published in RUP: 03.01.2022; Views: 1681; Downloads: 20
 Full text (355,79 KB) |
2. On girth and the parameterized complexity of token sliding and token jumpingValentin Bartier, Nicolas Bousquet, Clément Jean Dallard, Kyle Lomer, Amer E. Mouawad, 2021, original scientific article Keywords: combinatorial reconfiguration, independent set, token jumping, token sliding, parameterized complexity
Published in RUP: 16.07.2021; Views: 1711; Downloads: 28
 Link to full text |
3. On girth and the parameterized complexity of token sliding and token jumpingValentin Bartier, Nicolas Bousquet, Clément Jean Dallard, Kyle Lomer, Amer E. Mouawad, 2020, published scientific conference contribution Keywords: combinatorial reconfiguration, independent set, token jumping, token sliding, parameterized complexity
Published in RUP: 17.12.2020; Views: 1919; Downloads: 35
Link to full text |
4. Mind the independence gapTinaz Ekim, Didem Gozüpek, Ademir Hujdurović, Martin Milanič, 2020, original scientific article Keywords: maximal independent set, independent dominating set, well-covered graph, hereditary independence gap, polynomial-time algorithm, NP-hard problem
Published in RUP: 19.05.2020; Views: 2850; Downloads: 60
Link to full text |
5. |
6. |
7. |
8. |
9. |
