APA (7th ed.) Citation

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), 31. https://doi.org/10.1007/s10878-024-01207-w

Chicago Style (17th ed.) Citation

Nishat, Rahnuma Islam, Venkatesh Srinivasan, and Sue Whitesides. "The Hamiltonian Path Graph Is Connected for Simple S, t Paths in Rectangular Grid Graphs." Journal of Combinatorial Optimization 48, no. 4 (2024): 31. https://doi.org/10.1007/s10878-024-01207-w.

MLA (9th ed.) Citation

Nishat, Rahnuma Islam, et al. "The Hamiltonian Path Graph Is Connected for Simple S, t Paths in Rectangular Grid Graphs." Journal of Combinatorial Optimization, vol. 48, no. 4, 2024, p. 31, https://doi.org/10.1007/s10878-024-01207-w.