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 und 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, und S. Whitesides. „The Hamiltonian Path Graph Is Connected for Simple s, t Paths in Rectangular Grid Graphs“. Journal of Combinatorial Optimization, Bd. 48, Nr. 4, November 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. und 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, verfügbar unter:https://doi.org/10.1007/s10878-024-01207-w.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.