Hamiltonicity of a type of interchange graphs

DOI10.1016/0166-218X(94)90099-XzbMath0806.05047OpenAlexW1968778656MaRDI QIDQ1329809

Xue Liang Li, Fu Ji Zhang

Publication date: 31 July 1994

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

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90099-x

zbMATH Keywords

Hamiltonicityinterchange graph

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

On realization graphs of degree sequences ⋮ Some properties for a class of interchange graphs ⋮ On the upper bound of the diameter of interchange graphs ⋮ The realization graph of a degree sequence with majorization gap 1 is Hamiltonian ⋮ Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs

Cites Work

• Pancyclic properties of the graph of some 0-1 polyhedra
• Hamiltonicity in (0-1)-polyhedra
• Matrices of zeros and ones with fixed row and column sum vectors
• Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n)
• Small diameter interchange graphs of classes of matrices of zeros and ones
• Matroid basis graphs. I
• Matroid basis graphs. II
• Edge‐disjoint spanning trees: A connectedness theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hamiltonicity of a type of interchange graphs