Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: square

Sortuj według:

Ogranicz wyniki do:

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

The flower conjecture in special classes of graphs

100%

Ryjáček Z., Schiermeyer I.

Discussiones Mathematicae Graph Theory

1995

tom 15

nr 2

179-184

We say that a spanning eulerian subgraph F ⊂ G is a flower in a graph G if there is a vertex u ∈ V(G) (called the center of F) such that all vertices of G except u are of the degree exactly 2 in F. A graph G has the flower property if every vertex of G is a center of a flower. Kaneko conjectured that G has the flower property if and only if G is hamiltonian. In the present paper we prove this conjecture in several special classes of graphs, among others in squares and in a certain subclass of claw-free graphs.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Ryjáček Z.

1 Schiermeyer I.

1 1995

Wyniki wyszukiwania

The flower conjecture in special classes of graphs