Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs
type: Item
instance of: scholarly article
title: Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs
zbMATH Open document ID: 1027.05056
author: Richard A. Brualdi
author: J. Shen
published in: Journal of Combinatorial Theory. Series B
publication date: 2002-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C12
zbMATH DE Number: 1843827
zbMATH Keywords: girth
MaRDI profile type: Publication
full work available at URL: jctb.2001.2094
OpenAlex ID: W1966311297
cites work: Disjoint directed cycles
cites work: Q4888115
cites work: Matrices of zeros and ones with fixed row and column sum vectors
cites work: Q3346350
cites work: Q3818351
cites work: Hamiltonicity of a type of interchange graphs
cites work: On the upper bound of the diameter of interchange graphs
cites work: Combinatorial Properties of Matrices of Zeros and Ones
cites work: Q3851094
cites work: The connectivity of the interchange graph of class \({\mathfrak A}(R,S)\) of (0,1)-matrices
cites work: Minimal Interchanges of (0, 1)-Matrices and Disjoint Circuits in a Graph
cites work: A class of \((0,1)\)-polyhedra
cites work: Hamiltonicity of a class of interchange graphs of \((0,1)\) matrices.
DOI: 10.1006/JCTB.2001.2094
description: scientific article; zbMATH DE number 1843827