Splitters and barriers in open graphs having a perfect internal matching
AbstractA counterpart of Tutte's Theorem and Berge's formula is proved for open graphs with perfect (maximum) internal matchings. Properties of barriers and factor-critical graphs are studied in the new context, and an efficient algorithm is given to find maximal barriers of graphs having a perfect internal matching.
Download data is not yet available.
How to Cite
Bartha, M., & Krész, M. (2008). Splitters and barriers in open graphs having a perfect internal matching. Acta Cybernetica, 18(4), 697-718. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3746