TRIANGLE-FREE EQUIMATCHABLE GRAPHS

2021-10-04 10:00 — 11:00 Zoom Didem Gözüpek (Gebze Technical University, Turkey) TRIANGLE-FREE EQUIMATCHABLE GRAPHS A graph is called equimatchable if all of its maximal matchings have the same size. Frendrup et.al. provided a characterization of equimatchable graphs with girth at…


