- Tytuł:
- Minimal unavoidable sets of cycles in plane graphs
- Autorzy:
-
Madaras, T.
Tamasova, M. - Powiązania:
- https://bibliotekanauki.pl/articles/255251.pdf
- Data publikacji:
- 2018
- Wydawca:
- Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
- Tematy:
-
plane graph
polyhedral graph
set of cycles - Opis:
- A set S of cycles is minimal unavoidable in a graph family [formula] if each graph [formula] contains a cycle from S and, for each proper subset S' ⊂ S, there exists an infinite subfamily [formula] such that no graph from [formula] contains a cycle from S'. In this paper, we study minimal unavoidable sets of cycles in plane graphs of minimum degree at least 3 and present several graph constructions which forbid many cycle sets to be unavoidable. We also show the minimality of several small sets consisting of short cycles
- Źródło:
-
Opuscula Mathematica; 2018, 38, 6; 859-870
1232-9274
2300-6919 - Pojawia się w:
- Opuscula Mathematica
- Dostawca treści:
- Biblioteka Nauki
Artykuł