Existence of graphs with specified cycle lengths
type: Item
instance of: scholarly article
title: Existence of graphs with specified cycle lengths
zbMATH Open document ID: 0701.05031
DOI: 10.1016/0012-365X(89)90169-6
published in: Discrete Mathematics
publication date: 1989-01-01T00:00:00Z
review text: The two following theorems are proved. Let n,g\(\geq 3\) and let \(I\subseteq \{3,...,g\}.\) There exists an n-regular n-connected graph G such that for every \(i\in \{3,...,g\},\) G has a cycle of length i if and only if \(i\in I\). Let \(m,d\geq 1\) and let \(J\subseteq \{0,1,...,d\}.\) There exists an m- connected graph H such that for every \(i\in \{0,1,...,d\},\) H has a cycle of length v(H)-i if and only if \(i\in J\).
reviewed by: Philippe Vincke
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 4148125
zbMATH Keywords: cycle
zbMATH Keywords: length
author: William McCuaig
MaRDI profile type: Publication
cites work: Q5422499
cites work: On r-regular r-connected non-hamiltonian graphs
cites work: Regular Graphs with Given Girth and Restricted Circuits
full work available at URL: 0012-365x(89)90169-6
OpenAlex ID: W2059927582
description: scientific article; zbMATH DE number 4148125