We study snarks whose edges cannot be covered by fewer than ve perfect matchings. Esperet and Mazzuoccolo found an innite family of such snarks, generalising an example provided by Hagglund. We construct another innite family, arising from a generalisation in a dierent 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 fow number C(G) > 5 and admit a 5-cycle double cover.

Tree-like snarks

ABREU, Marien;LABBATE, Domenico;
2016-01-01

Abstract

We study snarks whose edges cannot be covered by fewer than ve perfect matchings. Esperet and Mazzuoccolo found an innite family of such snarks, generalising an example provided by Hagglund. We construct another innite family, arising from a generalisation in a dierent 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 fow number C(G) > 5 and admit a 5-cycle double cover.
2016
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11563/111536
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 17
  • ???jsp.display-item.citation.isi??? 12
social impact