Existence of openly disjoint circuits through a vertex

DOI10.1002/JGT.20411MaRDI QIDQ3553226zbMATH OpenOpenAlexFDO

Authors W. Mader

Publication date 22 April 2010

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20411

zbMATH Keywords

circuits in digraphsconnectivity in digraphsregular digraphs

Mathematics Subject Classification ID

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

Recommendations

• Openly disjoint circuits through a vertex in regular digraphs
• Disjoint directed cycles
• Vertex disjoint cycles of different length in digraphs
• Existence of vertices of local connectivity \(k\) in digraphs of large outdegree
• Vertex-disjoint cycles in regular tournaments

Cites work

• An application of connectivity theory in graphs to factorizations of elements in groups
• Eine Eigenschaft der Atome endlicher Graphen
• Even cycles in directed graphs
• Existence of vertices of local connectivity \(k\) in digraphs of large outdegree
• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• scientific article; zbMATH DE number 2188339 (Why is no real title available?)
• On minimal regular digraphs with given girth
• The 2-linkage problem for acyclic digraphs

Cited in

(2)

• Openly disjoint circuits through a vertex in regular digraphs
• Extensions of the Scherk-Kemperman theorem

This page was built for publication: Existence of openly disjoint circuits through a vertex

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