Stop the war!
Остановите войну!
for scientists:
default search action
"Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph."
Matthias Kriesell (2002)
- Matthias Kriesell:
Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph. Graphs Comb. 18(1): 133-146 (2002)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.