Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Lyndon Graphs are not Hamiltonian for \(n\) Even

J. Leslie Davison1
1Department of Mathematics and Computer Science Laurentian University Sudbury, Ontario, Canada P3E 2C6
  • Published: 30/04/1992

Abstract

Lyndon graphs are connected subgraphs of the \(n\)-cube which arise in the combinatorics of words. It is shown that these graphs are not Hamiltonian when \(n\) is even.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
J. Leslie Davison. Lyndon Graphs are not Hamiltonian for \(n\) Even[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 011. 109-112. DOI: .