A Note on n-Critical Bipartite Graphs and Its Application
From MaRDI portal
Publication:3637075
DOI10.1007/978-3-642-02026-1_26zbMath1246.05132MaRDI QIDQ3637075
Publication date: 7 July 2009
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02026-1_26
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs, Minimum \(k\)-critical bipartite graphs, Multiple bipartite complete matching vertex blocker problem: complexity, polyhedral analysis and branch-and-cut