EXPONENTIALLY MANY PERFECT MATCHINGS IN CUBIC GRAPHS L. ESPERET, F. KARDOŠ, A. D. KING, D. KRÁL’, AND S. NORINE Abstract. We show that every cubic bridgeless graph G has at least 2|V (G)| 3656 perfect matchings. This - Harries graph - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2016-02-04 05:53:38		EXPONENTIALLY MANY PERFECT MATCHINGS IN CUBIC GRAPHS L. ESPERET, F. KARDOŠ, A. D. KING, D. KRÁL’, AND S. NORINE Abstract. We show that every cubic bridgeless graph G has at least 2\|V (G)\|/3656 perfect matchings. This Add to Reading List Source URL: iti.mff.cuni.cz Download Document from Source Website File Size: 304,88 KB Share Document on Facebook