American Psychological Association 6th edition

Nishat, R. I., Srinivasan, V., & Whitesides, S. (2024). The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs. Journal of Combinatorial Optimization, 48(4). https://doi.org/10.1007/s10878-024-01207-w

ISO-690 (author-date, English)

NISHAT, Rahnuma Islam, SRINIVASAN, Venkatesh and WHITESIDES, Sue, 2024. The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs. Journal of Combinatorial Optimization. 1 November 2024. Vol. 48, no. 4, . DOI 10.1007/s10878-024-01207-w.

Modern Language Association 9th edition

Nishat, R. I., V. Srinivasan, and S. Whitesides. “The Hamiltonian Path Graph Is Connected for Simple s, t Paths in Rectangular Grid Graphs”. Journal of Combinatorial Optimization, vol. 48, no. 4, Nov. 2024, https://doi.org/10.1007/s10878-024-01207-w.

Mohr Siebeck - Recht (Deutsch - Österreich)

Nishat, Rahnuma Islam/Srinivasan, Venkatesh/Whitesides, Sue: The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs, Journal of Combinatorial Optimization 2024,

Emerald - Harvard

Nishat, R.I., Srinivasan, V. and Whitesides, S. (2024), “The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs”, Journal of Combinatorial Optimization, Vol. 48 No. 4, available at:https://doi.org/10.1007/s10878-024-01207-w.

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