Disjoint cycles in Eulerian diagraphs and the diameter of interchange graphs

Journal of Combinatorial Theory. Series B

Volumn 85, Issue 2, 2002, Pages 189-196

  Brualdi, Richard A ^a   Shen, Jian ^b  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b TEXAS STATE UNIVERSITY   (United States)

Author keywords

Arc disjoint cycles; Diameter; Eulerian digraph; Girth; Interchange graph; 0,1 matrix row (column) sum vector

Indexed keywords

EID: 0036311340     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2001.2094     Document Type: Article

References (13)

1. Disjoint directed cycles
2. Edge-disjoint cycles in regular directed graphs
3. Matrices of zeros and ones with fixed row and column sum vectors
4. The interchange graph of tournaments with the same score vector
5. The edge connectivity of interchange graphs of classes of matrices of zeros and ones
6. Hamiltonicity of a type of interchange graphs
7. On the upper bound of the diameter of interchange graphs
8. Combinatorial properties of matrices of zeros and ones
9. "Combinatorial Mathematics"
10. The connectivity of interchange graph of class A(R, S) of (0, 1)-matrices
11. Minimal interchanges of (0,1)-matrices and disjoint circuits in a graph
12. A type of (0,1)-polyhedra
13. Hamiltonicity of interchange graphs of a type of matrices of zeros and ones