A note on matchings and regu-larity of graphs
Tóm tắt
Let be a simple graph. We introduce the notion of comb-match , and prove that reg comb-match +1. This improves some known bounds.
Let be a simple graph. We introduce the notion of comb-match , and prove that reg comb-match +1. This improves some known bounds.