Graphs with each edge in at most one maximum matching

被引：0
|
作者：
Niu, Mengyuan [1 ]
Zhang, Yipei [2 ]
Liu, Jinfeng [1 ]
Wang, Xiumei [1 ]
机构：
[1] Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Peoples R China
[2] North China Univ Water Resources & Elect Power, Sch Math & Stat, Zhengzhou 450046, Peoples R China
来源：
DISCRETE APPLIED MATHEMATICS | 2024年 / 349卷
基金：
中国国家自然科学基金;
关键词：
Perfect matching; Maximum matching; Bipartite graph; Factor -critical graph;
D O I：
10.1016/j.dam.2024.01.038
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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. (c) 2024 Published by Elsevier B.V.
引用
收藏
页码：70 / 74
页数：5
相关论文
共 50 条
12345