We consider simple connected graphs for which there is a path of length at least 6 between every pair of distinct vertices. We wish to show that in these graphs the cycle space over $\mathbb{Z}_2$ is generated bythe cycles of length at least 6. Furthermore, we wish to generalize the result for k-path-connected graphs which contain a long cycle.

6–path connectivity and 6-generation

ABREU, Marien;LABBATE, Domenico;
2005

Abstract

We consider simple connected graphs for which there is a path of length at least 6 between every pair of distinct vertices. We wish to show that in these graphs the cycle space over $\mathbb{Z}_2$ is generated bythe cycles of length at least 6. Furthermore, we wish to generalize the result for k-path-connected graphs which contain a long cycle.
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: http://hdl.handle.net/11563/8933
 Attenzione

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

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 2
social impact