A Note on n-Critical Bipartite Graphs and Its Application

DOI10.1007/978-3-642-02026-1_26zbMath1246.05132OpenAlexW20174600MaRDI QIDQ3637075

Zhe Nie, Yueping Li

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

zbMATH Keywords

matchingassignment\(n\)-critical graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

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

This page was built for publication: A Note on n-Critical Bipartite Graphs and Its Application