Currently displaying 1 – 12 of 12

Showing per page

Order by Relevance | Title | Year of publication

The flower conjecture in special classes of graphs

Zdeněk RyjáčekIngo Schiermeyer — 1995

Discussiones Mathematicae Graph Theory

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...

Distance-Locally Disconnected Graphs

Mirka MillerJoe RyanZdeněk Ryjáček — 2013

Discussiones Mathematicae Graph Theory

For an integer k ≥ 1, we say that a (finite simple undirected) graph G is k-distance-locally disconnected, or simply k-locally disconnected if, for any x ∈ V (G), the set of vertices at distance at least 1 and at most k from x induces in G a disconnected graph. In this paper we study the asymptotic behavior of the number of edges of a k-locally disconnected graph on n vertices. For general graphs, we show that this number is Θ(n2) for any fixed value of k and, in the special case of regular graphs,...

Factor-criticality and matching extension in DCT-graphs

Odile FavaronEvelyne FavaronZdenĕk Ryjáček — 1997

Discussiones Mathematicae Graph Theory

The class of DCT-graphs is a common generalization of the classes of almost claw-free and quasi claw-free graphs. We prove that every even (2p+1)-connected DCT-graph G is p-extendable, i.e., every set of p independent edges of G is contained in a perfect matching of G. This result is obtained as a corollary of a stronger result concerning factor-criticality of DCT-graphs.

On traceability and 2-factors in claw-free graphs

Dalibor FrončekZdeněk RyjáčekZdzisław Skupień — 2004

Discussiones Mathematicae Graph Theory

If G is a claw-free graph of sufficiently large order n, satisfying a degree condition σₖ > n + k² - 4k + 7 (where k is an arbitrary constant), then G has a 2-factor with at most k - 1 components. As a second main result, we present classes of graphs ₁,...,₈ such that every sufficiently large connected claw-free graph satisfying degree condition σ₆(k) > n + 19 (or, as a corollary, δ(G) > (n+19)/6) either belongs to i = 1 i or is traceable.

Page 1

Download Results (CSV)