Bipartite graphs with a perfect matching and digraphs
From MaRDI portal
Publication:3392504
zbMath1189.05093arXiv1011.4359MaRDI QIDQ3392504
Publication date: 17 August 2009
Full work available at URL: https://arxiv.org/abs/1011.4359
bipartite graphsdigraphsirreducibleindecomposableperfect matchingelementary component\(k\)-extendablestrong componentstrongly \(k\)-connected
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (1)
This page was built for publication: Bipartite graphs with a perfect matching and digraphs