AbstractWe determine the minimum number of edges a graph needs in order to ensure that the subgraph induced by all vertices of degree at least d contains a cycle of length at least c, or cycles of all lengths up to c
AbstractWe investigate those graphs Gn with the property that any tree on n vertices occurs as subgr...
AbstractIt is proved that every directed graph with n vertices and minimum outdegree k contains a di...
AbstractN. Alon [J. Graph Theory 10 (1986), 123–127] proved that if the minimum degree of a graph G ...
AbstractWe determine the minimum number of edges a graph needs in order to ensure that the subgraph ...
AbstractIf a graph G has n vertices and 2n−1 edges, it must contain some proper subgraph of minimal ...
AbstractN. Alon [J. Graph Theory 10 (1986), 123–127] proved that if the minimum degree of a graph G ...
If a graph G has n vertices and 2n – 1 edges, it must contain some proper subgraph of minimal degree...
AbstractFor k ⩾ 2, any graph G with n vertices and (k−1)(n−k+2)+(2k−2) edges has a subrgraph of mini...
We study two extremal problems about subgraphs excluding a family F of graphs. i) Among all graphs w...
We study two extremal problems about subgraphs excluding a family F of graphs. i) Among all graphs w...
AbstractLet G be a simple graph on n vertices and m edges having circumference (longest cycle length...
We study two extremal problems about subgraphs excluding a family F of graphs. i) Among all graphs w...
AbstractGraphs with n + k vertices in which every set of n + j vertices induce a subgraph of maximum...
AbstractIf a graph G has n vertices and 2n−1 edges, it must contain some proper subgraph of minimal ...
AbstractWe show that for all positive ε, an integer N(ε) exists such that if G is any graph of order...
AbstractWe investigate those graphs Gn with the property that any tree on n vertices occurs as subgr...
AbstractIt is proved that every directed graph with n vertices and minimum outdegree k contains a di...
AbstractN. Alon [J. Graph Theory 10 (1986), 123–127] proved that if the minimum degree of a graph G ...
AbstractWe determine the minimum number of edges a graph needs in order to ensure that the subgraph ...
AbstractIf a graph G has n vertices and 2n−1 edges, it must contain some proper subgraph of minimal ...
AbstractN. Alon [J. Graph Theory 10 (1986), 123–127] proved that if the minimum degree of a graph G ...
If a graph G has n vertices and 2n – 1 edges, it must contain some proper subgraph of minimal degree...
AbstractFor k ⩾ 2, any graph G with n vertices and (k−1)(n−k+2)+(2k−2) edges has a subrgraph of mini...
We study two extremal problems about subgraphs excluding a family F of graphs. i) Among all graphs w...
We study two extremal problems about subgraphs excluding a family F of graphs. i) Among all graphs w...
AbstractLet G be a simple graph on n vertices and m edges having circumference (longest cycle length...
We study two extremal problems about subgraphs excluding a family F of graphs. i) Among all graphs w...
AbstractGraphs with n + k vertices in which every set of n + j vertices induce a subgraph of maximum...
AbstractIf a graph G has n vertices and 2n−1 edges, it must contain some proper subgraph of minimal ...
AbstractWe show that for all positive ε, an integer N(ε) exists such that if G is any graph of order...
AbstractWe investigate those graphs Gn with the property that any tree on n vertices occurs as subgr...
AbstractIt is proved that every directed graph with n vertices and minimum outdegree k contains a di...
AbstractN. Alon [J. Graph Theory 10 (1986), 123–127] proved that if the minimum degree of a graph G ...
DOI
Add to ORKG