Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs

DOI10.1006/JCTB.2001.2094MaRDI QIDQ1850606zbMATH OpenOpenAlexFDO

Authors Richard A. Brualdi, J. 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

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

Recommendations

• scientific article; zbMATH DE number 1881001
• On the upper bound of the diameter of interchange graphs
• Turán-type problem for a cycle of length \(6\) in bipartite Eulerian digraph.
• A note on the number of edges guaranteeing a \(C_4\) in Eulerian bipartite digraphs
• Diameter and maximum degree in Eulerian digraphs

Cites work

• scientific article; zbMATH DE number 3880741 (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 908792 (Why is no real title available?)
• A class of \((0,1)\)-polyhedra
• Combinatorial Properties of Matrices of Zeros and Ones
• Disjoint directed cycles
• 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
• Minimal Interchanges of (0, 1)-Matrices and Disjoint Circuits in a Graph
• On the upper bound of the diameter of interchange graphs
• The connectivity of the interchange graph of class \({\mathfrak A}(R,S)\) of (0,1)-matrices

Cited in

(13)

• Packing arc-disjoint cycles in oriented graphs
• scientific article; zbMATH DE number 5016710 (Why is no real title available?)
• On realization graphs of degree sequences
• scientific article; zbMATH DE number 1881001 (Why is no real title available?)
• Some properties for a class of interchange graphs
• Turán-type problem for a cycle of length \(6\) in bipartite Eulerian digraph.
• A note on heterochromatic \(C_4\) in edge-colored triangle-free graphs
• Euler digraphs
• Packing 4-cycles in Eulerian and bipartite Eulerian tournaments with an application to distances in interchange graphs
• On the balanced case of the Brualdi-Shen conjecture on 4-cycle decompositions of Eulerian bipartite tournaments
• Diameter and maximum degree in Eulerian digraphs
• A note on the number of edges guaranteeing a \(C_4\) in Eulerian bipartite digraphs
• Diameters of uniform subset graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850606)