- Tytuł:
- Ordered and linked chordal graphs
- Autorzy:
-
Böhme, Thomas
Gerlach, Tobias
Stiebitz, Michael - Powiązania:
- https://bibliotekanauki.pl/articles/743039.pdf
- Data publikacji:
- 2008
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
paths and cycles
connectivity
chordal graphs - Opis:
-
A graph G is called k-ordered if for every sequence of k distinct vertices there is a cycle traversing these vertices in the given order. In the present paper we consider two novel generalizations of this concept, k-vertex-edge-ordered and strongly k-vertex-edge-ordered. We prove the following results for a chordal graph G:
(a) G is (2k-3)-connected if and only if it is k-vertex-edge-ordered (k ≥ 3).
(b) G is (2k-1)-connected if and only if it is strongly k-vertex-edge-ordered (k ≥ 2).
(c) G is k-linked if and only if it is (2k-1)-connected. - Źródło:
-
Discussiones Mathematicae Graph Theory; 2008, 28, 2; 367-373
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł