Openly disjoint circuits through a vertex in regular digraphs

DOI10.1016/j.disc.2010.03.035zbMath1227.05174OpenAlexW2045961017MaRDI QIDQ709312

W. Mader

Publication date: 18 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.03.035

zbMATH Keywords

regular digraphopenly disjoint circuits

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The 2-linkage problem for acyclic digraphs
• Even cycles in directed graphs
• An application of connectivity theory in graphs to factorizations of elements in groups
• Existence of vertices of local connectivity \(k\) in digraphs of large outdegree
• Vertex-transitive graphs
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Existence of openly disjoint circuits through a vertex
• On Iterated Image Size for Point-Symmetric Relations
• On minimal regular digraphs with given girth

This page was built for publication: Openly disjoint circuits through a vertex in regular digraphs