Cycles of length 2 modulo 3 in graphs
type: Item
instance of: scholarly article
title: Cycles of length 2 modulo 3 in graphs
zbMATH Open document ID: 0760.05061
DOI: 10.1016/0012-365X(92)90609-J
author: Akira Saito
published in: Discrete Mathematics
publication date: 1993-01-16T00:00:00Z
review text: One theorem is shown: If a graph \(G\) with minimum degree \((\delta)\) at least 3 has no cycle of length \(2\pmod 3\), then \(G\) contains either an induced \(K_ 4\) or \(K_{3,3}\). A consequence is an earlier result by Dean et al. that a 2-connected graph \(G\) with \(\delta(G)\geq 3\) has a cycle of length \(2\pmod 3\) unless \(G\) is a \(K_ 4\) or \(K_{3,n}(n\geq 3)\).
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 89909
zbMATH Keywords: cycles of length 2 modulo 3
reviewed by: Norman F. Quimpo
MaRDI profile type: Publication
cites work: Q4873792
cites work: Q3818315
cites work: Graphs with a cycle of length divisible by three
full work available at URL: 0012-365x(92)90609-j
OpenAlex ID: W2042296027
Recommended article: Cycles of length 1 modulo 3 in graph
Recommended article: Q4873792
Recommended article: Cycles of length 0 modulo 4 in graphs
Recommended article: Graphs with a cycle of length divisible by three
Recommended article: Cycle Lengths Modulo k in Large 3-connected Cubic Graphs, Advances in Combinatorics
Recommended article: Cycles in 2-connected graphs
Recommended article: On cycles in 3-connected graphs
Recommended article: On cycle lengths in graphs of moderate degree
Recommended article: Q4301915
Recommended article: On 2-cycles of graphs
description: scientific article; zbMATH DE number 89909