Splitters and barriers in open graphs having a perfect internal matching
A 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 perfec...
Saved in:
| Main Authors: | |
|---|---|
| Format: | Article |
| Published: |
2008
|
| Series: | Acta cybernetica
18 No. 4 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12843 |
| Summary: | A 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. |
|---|---|
| Physical Description: | 697-718 |
| ISSN: | 0324-721X |