AbstractLet G be a simple graph on n vertices and m edges having circumference (longest cycle length) t. Woodall determined some time ago the maximum possible value of m. The object of this paper is to give an alternative proof of Woodall's theorem. Our approach will, in addition, characterize the structure of the extremal graphs
Let m(G) denote the number of maximal independent sets of vertices in a graph G and let c(n, r) be t...
Let Gt(n) be the class of connected graphs on n vertices having the longest cycle of length t and ...
Let Gn be a class of graphs on n vertices.For an integer c, let ex(Gn,c) be the smallest integer suc...
AbstractLet G be a simple graph on n vertices and m edges having circumference (longest cycle length...
Let Gt(n) be the class of connected graphs on n vertices having the longest cycle of length t and le...
AbstractA cycle C in an undirected and simple graph G is dominating if G - C is edgeless. A graph G ...
We determine the maximum number of induced cycles that can be contained in a graph on n ≥ n0 vertice...
We determine the maximum number of induced cycles that can be contained in a graph on n ≥ n0 vertice...
Let us write f(n, Δ; C2k+1) for the maximal number of edges in a graph of order n and maximum degree...
AbstractN. Alon [J. Graph Theory 10 (1986), 123–127] proved that if the minimum degree of a graph G ...
DOI 10.1002/jgt.20186 Abstract: Let m(G) denote the number of maximal independent sets of vertices i...
AbstractLet f(n) be the maximum possible number of edges in a graph on n vertices in which no two cy...
Research Doctorate - Doctor of Philosophy (PhD)The question of Turán on the maximum number of edges ...
We are given a set V of vertices and a class of graphs on V. In this paper we examine the following ...
AbstractLet Gn be a class of graphs on n vertices. For an integer c, let ex(Gn,c) be the smallest in...
Let m(G) denote the number of maximal independent sets of vertices in a graph G and let c(n, r) be t...
Let Gt(n) be the class of connected graphs on n vertices having the longest cycle of length t and ...
Let Gn be a class of graphs on n vertices.For an integer c, let ex(Gn,c) be the smallest integer suc...
AbstractLet G be a simple graph on n vertices and m edges having circumference (longest cycle length...
Let Gt(n) be the class of connected graphs on n vertices having the longest cycle of length t and le...
AbstractA cycle C in an undirected and simple graph G is dominating if G - C is edgeless. A graph G ...
We determine the maximum number of induced cycles that can be contained in a graph on n ≥ n0 vertice...
We determine the maximum number of induced cycles that can be contained in a graph on n ≥ n0 vertice...
Let us write f(n, Δ; C2k+1) for the maximal number of edges in a graph of order n and maximum degree...
AbstractN. Alon [J. Graph Theory 10 (1986), 123–127] proved that if the minimum degree of a graph G ...
DOI 10.1002/jgt.20186 Abstract: Let m(G) denote the number of maximal independent sets of vertices i...
AbstractLet f(n) be the maximum possible number of edges in a graph on n vertices in which no two cy...
Research Doctorate - Doctor of Philosophy (PhD)The question of Turán on the maximum number of edges ...
We are given a set V of vertices and a class of graphs on V. In this paper we examine the following ...
AbstractLet Gn be a class of graphs on n vertices. For an integer c, let ex(Gn,c) be the smallest in...
Let m(G) denote the number of maximal independent sets of vertices in a graph G and let c(n, r) be t...
Let Gt(n) be the class of connected graphs on n vertices having the longest cycle of length t and ...
Let Gn be a class of graphs on n vertices.For an integer c, let ex(Gn,c) be the smallest integer suc...
DOI
Add to ORKG