Twin-constrained Hamiltonian paths on threshold graphs: an approach to the minimum score separation problem

Summary

Twin-constrained Hamiltonian paths on threshold graphs: an approach to the minimum score separation problem is a doctoral thesis^[1].

Key Facts

• Twin-constrained Hamiltonian paths on threshold graphs: an approach to the minimum score separation problem authored an approach to the minimum score separation problem — author (P50): Kai Helge Becker^[2].
• Twin-constrained Hamiltonian paths on threshold graphs: an approach to the minimum score separation problem's instance of is recorded as an approach to the minimum score separation problem — instance of (P31): doctoral thesis^[3].
• Twin-constrained Hamiltonian paths on threshold graphs: an approach to the minimum score separation problem's language of work or name is recorded as an approach to the minimum score separation problem — language of work or name (P407): English^[4].
• Twin-constrained Hamiltonian paths on threshold graphs: an approach to the minimum score separation problem was published on 2010^[5].
• Twin-constrained Hamiltonian paths on threshold graphs: an approach to the minimum score separation problem's work available at URL is recorded as https://researchonline.lse.ac.uk/id/eprint/134185/^[6].
• Twin-constrained Hamiltonian paths on threshold graphs: an approach to the minimum score separation problem's number of pages is recorded as {'unit': '1', 'amount': '+259'}^[7].
• Twin-constrained Hamiltonian paths on threshold graphs: an approach to the minimum score separation problem's title is recorded as Twin-constrained Hamiltonian paths on threshold graphs: an approach to the minimum score separation problem^[8].
• Twin-constrained Hamiltonian paths on threshold graphs: an approach to the minimum score separation problem's thesis submitted to is recorded as an approach to the minimum score separation problem — thesis submitted to (P4101): London School of Economics and Political Science^[9].
• Twin-constrained Hamiltonian paths on threshold graphs: an approach to the minimum score separation problem's on focus list of Wikimedia project is recorded as an approach to the minimum score separation problem — on focus list of Wikimedia project (P5008): LSEThesisProject^[10].
• Twin-constrained Hamiltonian paths on threshold graphs: an approach to the minimum score separation problem's copyright status is recorded as an approach to the minimum score separation problem — copyright status (P6216): copyrighted^[11].
• Twin-constrained Hamiltonian paths on threshold graphs: an approach to the minimum score separation problem's online access status is recorded as an approach to the minimum score separation problem — online access status (P6954): open access^[12].

Body

Designation and Status

Twin-constrained Hamiltonian paths on threshold graphs: an approach to the minimum score separation problem's instance of is recorded as an approach to the minimum score separation problem — instance of (P31): doctoral thesis^[3].