|
|||||
|
|
Unions of perfect matchings in cubic graphs |
|
| Institution: | 1. School of Applied Mathematics, Xiamen University of Technology, Xiamen, Fujian 361024, China;2. Department of Mathematics, Faculty of Science, Aljouf University, Aljouf, Saudi Arabia;3. Center for Computational Sciences, Middle Tennessee State University, Murfreesboro, TN 37132, USA;4. Department of Mathematical Sciences, Middle Tennessee State University, Murfreesboro, TN 37132, USA |
| Abstract: | We show that any cubic bridgeless graph with m edges contains two perfect matchings that cover at least 3m/5 and three perfect matchings that cover at least 27m/35 of its edges. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |