Hamiltonicity of a type of interchange graphs

DOI10.1016/0166-218X(94)90099-XzbMATH Open0806.05047OpenAlexW1968778656MaRDI QIDQ1329809FDOQ1329809

Authors: Xueliang Li, Fuji 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

Recommendations

• Some properties of a class of interchange graphs
• A class of \((0,1)\)-polyhedra
• scientific article; zbMATH DE number 4089595
• scientific article; zbMATH DE number 1334614
• On the upper bound of the diameter of interchange graphs

zbMATH Keywords

Hamiltonicityinterchange graph

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n)
• Title not available (Why is that?)
• Matrices of zeros and ones with fixed row and column sum vectors
• Hamiltonicity in (0-1)-polyhedra
• Edge‐disjoint spanning trees: A connectedness theorem
• Small diameter interchange graphs of classes of matrices of zeros and ones
• Matroid basis graphs. I
• Matroid basis graphs. II
• Pancyclic properties of the graph of some 0-1 polyhedra
• Connectivity of generalized Cartesian product graphs

Cited In (8)

• Title not available (Why is that?)
• 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
• A class of \((0,1)\)-polyhedra
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329809)