Long cycles in graphs with large degree sums

Authors:
D. Bauer;H. J. Veldman;A. Morgana;E. F. Schmeichel
Affiliations:
-;-;-;-
Venue:
Discrete Mathematics
Year:
1990

Citing 0
Cited 2

Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion

Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Binding Number, Minimum Degree, and Cycle Structure in Graphs

Journal of Graph Theory

Quantified Score

Hi-index	0.05

Visualization

Abstract