- Tytuł:
- The flower conjecture in special classes of graphs
- Autorzy:
-
Ryjáček, Zdeněk
Schiermeyer, Ingo - Powiązania:
- https://bibliotekanauki.pl/articles/972046.pdf
- Data publikacji:
- 1995
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
hamiltonian graphs
flower conjecture
square
claw-free graphs - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 1995, 15, 2; 179-184
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł