Works (1)

Updated: July 5th, 2023 15:59

2003 journal article

On the existence of Hamiltonian paths in the cover graph of M(n)

DISCRETE MATHEMATICS, 262(1-3), 241–252.

By: C. Savage n, I. Shields* & D. West*

author keywords: Hamiltonian path; gray code; cover graph; augmentation poset
TL;DR: It is shown that the cover graph of M(n) has a Hamiltonian path if and only if(n+12) is odd and n ≠ 5. (via Semantic Scholar)
UN Sustainable Development Goal Categories
4. Quality Education (Web of Science)
Sources: Web Of Science, NC State University Libraries
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.