Degree and local connectivity in digraphs

DOI10.1007/BF02579379zbMath0576.05044OpenAlexW1993863770MaRDI QIDQ1065027

W. Mader

Publication date: 1985

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579379

zbMATH Keywords

digraphedge-disjoint pathsdirected multigraphsopenly disjoint paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (6)

Immersion of transitive tournaments in digraphs with large minimum outdegree ⋮ Existence of vertices of local connectivity \(k\) in digraphs of large outdegree ⋮ Complete directed minors and chromatic number ⋮ Immersing complete digraphs ⋮ Subdivisions in digraphs of large out-degree or large dichromatic number ⋮ Highly linked tournaments with large minimum out-degree

Cites Work

• Even cycles in directed graphs
• An application of connectivity theory in graphs to factorizations of elements in groups
• Transversal theory. An account of some aspects of combinatorial mathematics
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Connectivity in digraphs
• On Flows in Pseudosymmetric Networks
• Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind

This page was built for publication: Degree and local connectivity in digraphs