Pairs of disjoint matchings and related classes of graphs

Huizheng, Guo, Kieran Kaempen +6

For a finite graph $G$, we study the maximum $2$-edge colorable subgraph problem and a related ratio $\frac{\hat{I}¼(G)}{\hat{I}½(G)}$, where $\hat{I}½(G)$ is the matching number of $G$, and $\hat{I}¼(G)$…