On the upper bound of the diameter of interchange graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3981359 (Why is no real title available?)
- scientific article; zbMATH DE number 4089595 (Why is no real title available?)
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 3895226 (Why is no real title available?)
- A class of \((0,1)\)-polyhedra
- Cayley graphs and interchange graphs
- Chromatic number of classes of matrices of zeros and ones
- Hamiltonicity of a class of interchange graphs of \((0,1)\) matrices.
- Hamiltonicity of a type of interchange graphs
- Matrices of zeros and ones with fixed row and column sum vectors
- Properties of a Class of (0,1)-Matrices Covering a given Matrix
- Small diameter interchange graphs of classes of matrices of zeros and ones
- Some properties of a class of interchange graphs
- The connectivity of the interchange graph of class \({\mathfrak A}(R,S)\) of (0,1)-matrices
Cited in
(6)- On realization graphs of degree sequences
- scientific article; zbMATH DE number 1881001 (Why is no real title available?)
- Hamiltonicity of a type of interchange graphs
- Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs
- A class of \((0,1)\)-polyhedra
- A lower bound on the diameter of the flip graph
This page was built for publication: On the upper bound of the diameter of interchange graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296994)
