We study snarks whose edges cannot be covered by fewer than five perfect matchings. Esperet and Mazzuoccolo found an infinite family of such snarks, generalising an example provided by Hägglund. We construct another infinite family, arising from a generalisation in a different direction. The proof that this family has the requested property is computer-assisted. In addition, we prove that the snarks from this family (we call them treelike snarks) have circular flow number φ C (G) > 5 and admit a 5-cycle double cover.
Treelike Snarks
Mazzuoccolo, Giuseppe
2016-01-01
Abstract
We study snarks whose edges cannot be covered by fewer than five perfect matchings. Esperet and Mazzuoccolo found an infinite family of such snarks, generalising an example provided by Hägglund. We construct another infinite family, arising from a generalisation in a different direction. The proof that this family has the requested property is computer-assisted. In addition, we prove that the snarks from this family (we call them treelike snarks) have circular flow number φ C (G) > 5 and admit a 5-cycle double cover.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
6008-18625-3-PB-1.pdf
accesso aperto
Tipologia:
Versione dell'editore
Licenza:
Accesso ristretto
Dimensione
366.85 kB
Formato
Adobe PDF
|
366.85 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.