Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs

DOI10.1006/jctb.2001.2094zbMath1027.05056OpenAlexW1966311297MaRDI QIDQ1850606

Richard A. Brualdi, Jian Shen

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2001.2094

zbMATH Keywords

girth

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

On realization graphs of degree sequences ⋮ A note on heterochromatic \(C_4\) in edge-colored triangle-free graphs ⋮ Some properties for a class of interchange graphs ⋮ Packing arc-disjoint cycles in oriented graphs ⋮ Diameters of uniform subset graphs ⋮ Euler Digraphs ⋮ On the Balanced Case of the Brualdi-Shen Conjecture on 4-Cycle Decompositions of Eulerian Bipartite Tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The connectivity of the interchange graph of class \({\mathfrak A}(R,S)\) of (0,1)-matrices
• Disjoint directed cycles
• Matrices of zeros and ones with fixed row and column sum vectors
• On the upper bound of the diameter of interchange graphs
• Hamiltonicity of a type of interchange graphs
• Combinatorial Properties of Matrices of Zeros and Ones
• Minimal Interchanges of (0, 1)-Matrices and Disjoint Circuits in a Graph

This page was built for publication: Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs