Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs

DOI10.1006/JCTB.2001.2094zbMATH Open1027.05056OpenAlexW1966311297MaRDI QIDQ1850606FDOQ1850606

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

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

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)

Cites Work

• Title not available (Why is that?)
• 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
• Hamiltonicity of a class of interchange graphs of \((0,1)\) matrices.
• Combinatorial Properties of Matrices of Zeros and Ones
• Title not available (Why is that?)
• Title not available (Why is that?)
• The connectivity of the interchange graph of class \({\mathfrak A}(R,S)\) of (0,1)-matrices
• Disjoint directed cycles
• Minimal Interchanges of (0, 1)-Matrices and Disjoint Circuits in a Graph
• A class of \((0,1)\)-polyhedra
• Title not available (Why is that?)

Cited In (13)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On realization graphs of degree sequences
• 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
• On the balanced case of the Brualdi-Shen conjecture on 4-cycle decompositions of Eulerian bipartite tournaments
• Packing 4-cycles in Eulerian and bipartite Eulerian tournaments with an application to distances in interchange graphs
• 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
• Packing arc-disjoint cycles in oriented 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)