Splitters and barriers in open graphs having a perfect internal matching

Bartha, Miklós and Krész, Miklós: Splitters and barriers in open graphs having a perfect internal matching. Acta cybernetica, (18) 4. pp. 697-718. (2008)

[img] Cikk, tanulmány, mű
Bartha_2008_ActaCybernetica.pdf

Download (230kB)

Abstract

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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2008
Volume: 18
Number: 4
Page Range: pp. 697-718
ISSN: 0324-721X
Language: angol
Heading title: Regular papers
Uncontrolled Keywords: Természettudomány, Informatika
Additional Information: Bibliogr.: 718. p.; Abstract
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2018. Jun. 05. 14:45
URI: http://acta.bibl.u-szeged.hu/id/eprint/12843

Actions (login required)

View Item View Item