Back to Search
Start Over
Graphs with each edge in at most one maximum matching.
- Source :
-
Discrete Applied Mathematics . May2024, Vol. 349, p70-74. 5p. - Publication Year :
- 2024
-
Abstract
- A matching in a graph is a set of pairwise nonadjacent edges. A maximum matching is a matching which covers as many vertices as possible. In this paper, using the Gallai–Edmonds Structure Theorem, we obtain a characterization of graphs each of whose edges belongs to at most one maximum matching. [ABSTRACT FROM AUTHOR]
- Subjects :
- *BIPARTITE graphs
Subjects
Details
- Language :
- English
- ISSN :
- 0166218X
- Volume :
- 349
- Database :
- Academic Search Index
- Journal :
- Discrete Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 176247648
- Full Text :
- https://doi.org/10.1016/j.dam.2024.01.038