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-01-01
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.
