"Beyond Quasi-Adjoint Graphs: On Polynomial-Time Solvable Cases of the ..."

Marta Kasprzak (2024)

> Home

Details and statistics

DOI: 10.15388/24-INFOR568

access: closed

type: Journal Article

metadata version: 2025-03-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/informaticaLT/Kasprzak24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/informaticaLT/Kasprzak24
Marta Kasprzak:
Beyond Quasi-Adjoint Graphs: On Polynomial-Time Solvable Cases of the Hamiltonian Cycle and Path Problems. Informatica 35(4): 807-816 (2024)

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.