Stop the war!
Остановите войну!
for scientists:
default search action
"How many disjoint 2-edge paths must a cubic graph have?"
Alexander K. Kelmans, Dhruv Mubayi (2004)
- Alexander K. Kelmans, Dhruv Mubayi:
How many disjoint 2-edge paths must a cubic graph have? J. Graph Theory 45(1): 57-79 (2004)
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.