Splitters and barriers in open graphs having a perfect internal matching

Authors:
Miklós Bartha;Miklós Krész
Affiliations:
Department of Computer Science, Memorial University of Newfoundland, St. John's, NL, Canada;Department of Computer Science, University of Szeged, Faculty of Juhász Gyula Teacher Training College, Szeged, Hungary
Venue:
Acta Cybernetica
Year:
2008

Citing 7
Cited 0

Soliton automata

Journal of Computer and System Sciences
A structure theorem for maximum internal matchings in graphs

Information Processing Letters
Structuring the elementary components of graphs having a perfect internal matching

Theoretical Computer Science
Tutte type theorems for graphs having a perfect internal matching

Information Processing Letters
Matching Theory (North-Holland mathematics studies)

Matching Theory (North-Holland mathematics studies)
Tutte sets in graphs II: The complexity of finding maximum Tutte sets

Discrete Applied Mathematics
Tutte sets in graphs I: Maximal tutte sets and D-graphs

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

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.