Long cycles in graphs with no subgraphs of minimal degree 3

Authors:
B. Bollobás;G. Brightwell
Affiliations:
Univ. of Cambridge, Cambridge, UK;Univ. of Cambridge, Cambridge, UK
Venue:
Discrete Mathematics
Year:
1989

Citing 0
Cited 5

Minimum degree and density of binary sequences

European Journal of Combinatorics
On approximating the d-girth of a graph

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Parameterized complexity of finding small degree-constrained subgraphs

Journal of Discrete Algorithms
On the approximability of some degree-constrained subgraph problems

Discrete Applied Mathematics
On approximating the d-girth of a graph

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract