Induced paths in graphs without anticomplete cycles
Let us say a graph is Os -free, where s ≥ 1 is an integer, if there do not exist s cycles of the graph that are pairwise vertex-disjoint and have no edges joining them. The structure of such graphs, even when s = 2, is not well understood. For instance, until now we did not know how to test whether...
| Главные авторы: | , , |
|---|---|
| Формат: | Journal article |
| Язык: | English |
| Опубликовано: |
Elsevier
2023
|