Hamiltonicity of a type of interchange graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- Connectivity of generalized Cartesian product graphs
- Convex polyhedra of doubly stochastic matrices. II: Graph of Omega sub(n)
- Edge‐disjoint spanning trees: A connectedness theorem
- Graph theory
- Hamiltonicity in (0-1)-polyhedra
- Matrices of zeros and ones with fixed row and column sum vectors
- Matroid basis graphs. I
- Matroid basis graphs. II
- Pancyclic properties of the graph of some 0-1 polyhedra
- Small diameter interchange graphs of classes of matrices of zeros and ones
Cited in
(8)- On realization graphs of degree sequences
- scientific article; zbMATH DE number 4089595 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 1560890 (Why is no real title available?)
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)
