On the divisibility of the cycle number by 7
type: Item
instance of: scholarly article
title: On the divisibility of the cycle number by 7
zbMATH Open document ID: 0795.05084
DOI: 10.1016/0012-365X(93)90592-H
author: Linda Valdés
published in: Discrete Mathematics
publication date: 1993-11-01T00:00:00Z
review text: It is shown that for every even \(p \geq 4\), there exists a nonseparable cubic graph \(G\), such that the number of cycles in \(G\) is a multiple of seven. This answers a question by Gerhard Ringel. It is also shown that there exists a nonseparable cubic graph whose cycle number is congruent to \(k \pmod 7\) where \(k=0\) when \(p \geq 4\), \(k=1\) when \(p \geq 6\), \(k=5\) when \(p \geq 8\), and \(k=2,3,4,6\) when \(p \geq 10\).
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C30
zbMATH DE Number: 429162
zbMATH Keywords: nonseparable cubic graph
zbMATH Keywords: cycles
zbMATH Keywords: cycle number
reviewed by: Jørgen Bang-Jensen
MaRDI profile type: MaRDI publication profile
cites work: Q4187840
cites work: Q4083484
Recommended article: Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics
Recommended article: Nonseparable graphs with a given number of cycles
Recommended article: Q4873792
Recommended article: Q3058992
Recommended article: Q3115080
description: scientific article; zbMATH DE number 429162