Two Hamilton cycles in bipartite reflective Kneser graphs

DOI10.1016/0012-365X(88)90194-XzbMath0659.05063OpenAlexW1988175779MaRDI QIDQ1112063

S. H. Smith

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90194-x

zbMATH Keywords

Hamilton cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45)

Related Items (14)

Updating the hamiltonian problem—A survey ⋮ Lexicographic matchings cannot form Hamiltonian cycles ⋮ Two Hamilton cycles in bipartite reflective Kneser graphs ⋮ Explicit matchings in the middle levels of the Boolean lattice ⋮ \([1,2\)-domination in graphs] ⋮ Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups ⋮ Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups ⋮ A note on Frucht diagrams, Boolean graphs and Hamilton cycles ⋮ A new class of transitive graphs ⋮ A numeral system for the middle-levels graphs ⋮ Boolean layer cakes ⋮ Hamiltonian Cycles in Kneser Graphs for ⋮ Kneser graphs are Hamiltonian for \(n\geq 3k\) ⋮ The antipodal layers problem

Cites Work

• Two Hamilton cycles in bipartite reflective Kneser graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Two Hamilton cycles in bipartite reflective Kneser graphs