A note on minimal matching covered graphs

Details A note on minimal matching covered graphs A note on minimal matching covered graphs

2007-07-13

arxiv.org/abs/0707.1925v1

Discrete Mathematics 306, (2006), pp. 452-455

Computer Science

Discrete Mathematics

4 pages

Scientific paper

10.1016/j.disc.2005.12.006

A graph is called matching covered if for its every edge there is a maximum
matching containing it. It is shown that minimal matching covered graphs
contain a perfect matching.

Affiliated with

Also associated with

No associations

Rating

A note on minimal matching covered graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A note on minimal matching covered graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on minimal matching covered graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-60095