It is not hard to show that you can cover the edges of a bridgeless cubic graph with perfect matchings. Is there some smaller-order function that suffices?
login/create account
Drupal
CSI of Charles University
Covering with perfect matchings
It is not hard to show that you can cover the edges of a bridgeless cubic graph with
perfect matchings. Is there some smaller-order function that suffices?