Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: paths and cycles

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Ordered and linked chordal graphs

100%

Böhme T., Gerlach T., Stiebitz M.

Discussiones Mathematicae Graph Theory

2008

tom 28

nr 2

367-373

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Böhme T.

1 Gerlach T.

1 Stiebitz M.

1 2008

Wyniki wyszukiwania

Ordered and linked chordal graphs