Toggle navigation
Login
Toggle navigation
JavaScript is disabled for your browser. Some features of this site may not work without it.
A POLYNOMIAL-TIME ALGORITHM TO DETERMINE (ALMOST) HAMILTONICITY OF DENSE REGULAR GRAPHS
QMRO Home
School of Mathematical Sciences
Mathematics
A POLYNOMIAL-TIME ALGORITHM TO DETERMINE (ALMOST) HAMILTONICITY OF DENSE REGULAR GRAPHS
QMRO Home
School of Mathematical Sciences
Mathematics
A POLYNOMIAL-TIME ALGORITHM TO DETERMINE (ALMOST) HAMILTONICITY OF DENSE REGULAR GRAPHS
Browse
All of QMRO
Communities & Collections
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
Administrators only
Login
Statistics
Most Popular Items
Statistics by Country
Most Popular Authors
A POLYNOMIAL-TIME ALGORITHM TO DETERMINE (ALMOST) HAMILTONICITY OF DENSE REGULAR GRAPHS
Volume
36
Pagination
1363 - 1393
DOI
10.1137/20M1356191
Journal
SIAM JOURNAL ON DISCRETE MATHEMATICS
Issue
2
ISSN
0895-4801
Metadata
Show full item record
Authors
Patel, V; Stroh, F
URI
https://qmro.qmul.ac.uk/xmlui/handle/123456789/80410
Collections
Mathematics
[1686]
Copyright statements
© by SIAM.