On the perfect matching index of bridgeless cubic graphs

Simple item page
dc.creatorFouquet, Jean-Luc
dc.creatorVanherpe, Jean-Marie
dc.date2009-04-08
dc.date.accessioned2026-07-07T13:01:41Z
dc.date.available2026-07-07T13:01:41Z
dc.descriptionIf $G$ is a bridgeless cubic graph, Fulkerson conjectured that we can find 6 perfect matchings $M_1,...,M_6$ of $G$ with the property that every edge of $G$ is contained in exactly two of them and Berge conjectured that its edge set can be covered by 5 perfect matchings. We define $τ(G)$ as the least number of perfect matchings allowing to cover the edge set of a bridgeless cubic graph and we study this parameter. The set of graphs with perfect matching index 4 seems interesting and we give some informations on this class.
dc.identifierhttps://arxiv.org/abs/0904.1296
dc.identifierhttp://arxiv.org/abs/0904.1296
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/226232
dc.subjectDiscrete Mathematics
dc.titleOn the perfect matching index of bridgeless cubic graphs
dc.typetext

Files

Collections

arXiv