APA (7th ed.) Citation

Sarkar, N. (2020). Any Three Longest Paths In A Connected Graph Has A Common Vertex.

Chicago Style (17th ed.) Citation

Sarkar, Nirankush. Any Three Longest Paths In A Connected Graph Has A Common Vertex. 2020.

MLA (9th ed.) Citation

Sarkar, Nirankush. Any Three Longest Paths In A Connected Graph Has A Common Vertex. 2020.

Warning: These citations may not always be 100% accurate.