A structure theorem for maximum internal matchings in graphs (Q1183490): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3687744 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Deterministic soliton automata with at most one cycle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Soliton automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Paths, Trees, and Flowers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5520564 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5508779 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Representatives of Subsets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matching theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Factorization of Linear Graphs / rank | |||
Normal rank | |||
Latest revision as of 15:48, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A structure theorem for maximum internal matchings in graphs |
scientific article |
Statements
A structure theorem for maximum internal matchings in graphs (English)
0 references
28 June 1992
0 references
Extended abstract: An external vertex is one of degree one; others are internal vertices. A counterpart of the Gallai-Edmonds structure theorem is proved for matchings that are not required to cover the external vertices of graphs. The appropriate counterpart of Tutte's theorem is derived from this result for the existence of perfect internal matchings in graphs.
0 references
factor-critical graph
0 references
bipartite graph
0 references
Gallai-Edmonds structure theorem
0 references
Tutte's theorem
0 references
perfect internal matchings
0 references
