AbstractHajnal and Corrádi proved that any simple graph on at least 3k vertices with minimal degree at least 2k contains k independent cycles. We prove the analogous result for chorded cycles. Let G be a simple graph with |V(G)|⩾4k and minimal degree δ(G)⩾3k. Then G contains k independent chorded cycles. This result is sharp
Let G be a simple graph of order n and minimal degree \u3e cn (0 \u3c c \u3c 1/2). We prove that (1)...
We study some counting and enumeration problems for chordal graphs, especially concerning independen...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. ...
AbstractHajnal and Corrádi proved that any simple graph on at least 3k vertices with minimal degree ...
AbstractLet G be a graph of order at least 3k, where k is a positive integer. Justesen (Ann. Disc. M...
AbstractWe propose the following conjecture to generalize results of Pósa and of Corrádi and Hajnal....
In 1963, Corradi and Hajnal proved that for any positive integer k if a graph contains at least 3k v...
AbstractLet G be a graph of order at least 3k, where k is a positive integer. Justesen (Ann. Disc. M...
AbstractJamison proved that every cycle of length greater than three in a graph has a chord—in other...
AbstractLetG=(V1, V2; E) be a bipartite graph with |V1|=|V2|=n⩾2k, wherekis a positive integer. Supp...
AbstractA graph G of order n is a ck-graph if for every pair of distinct, nonadjacent vertices x and...
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that wit...
AbstractLet G be a simple graph of order n, k a positive integer with n⩾3k and X a set of any k vert...
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that wit...
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that wit...
Let G be a simple graph of order n and minimal degree \u3e cn (0 \u3c c \u3c 1/2). We prove that (1)...
We study some counting and enumeration problems for chordal graphs, especially concerning independen...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. ...
AbstractHajnal and Corrádi proved that any simple graph on at least 3k vertices with minimal degree ...
AbstractLet G be a graph of order at least 3k, where k is a positive integer. Justesen (Ann. Disc. M...
AbstractWe propose the following conjecture to generalize results of Pósa and of Corrádi and Hajnal....
In 1963, Corradi and Hajnal proved that for any positive integer k if a graph contains at least 3k v...
AbstractLet G be a graph of order at least 3k, where k is a positive integer. Justesen (Ann. Disc. M...
AbstractJamison proved that every cycle of length greater than three in a graph has a chord—in other...
AbstractLetG=(V1, V2; E) be a bipartite graph with |V1|=|V2|=n⩾2k, wherekis a positive integer. Supp...
AbstractA graph G of order n is a ck-graph if for every pair of distinct, nonadjacent vertices x and...
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that wit...
AbstractLet G be a simple graph of order n, k a positive integer with n⩾3k and X a set of any k vert...
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that wit...
A classical result of Hajnal and Szemerédi, when translated to a complementary form, states that wit...
Let G be a simple graph of order n and minimal degree \u3e cn (0 \u3c c \u3c 1/2). We prove that (1)...
We study some counting and enumeration problems for chordal graphs, especially concerning independen...
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. ...
DOI
Add to ORKG