Two vertex-disjoint cycles in a graph
type: Item
instance of: scholarly article
title: Two vertex-disjoint cycles in a graph
zbMATH Open document ID: 0838.05073
DOI: 10.1007/BF01787818
author: Hong Wang
published in: Graphs and Combinatorics
publication date: 1996-02-13T00:00:00Z
review text: The author proves that any graph \(G\) of order \(n\geq 6\) and degree at least \(\lceil(n+ 1)/2\rceil\) contains two cycles---of lengths \(s\) and \(t\), when \(s+ t\leq n\) and \(s\geq 3\), \(t\geq 3\) unless \(s\), \(t\) and \(n\) are odd and \(G\) is isomorphic to \(K_{(n- 1)/2,(n- 1)/2}+ K_1\). Similarly, if \(n\geq 8\) is even, and the minimum degree is at least \(n/2\), then \(G\) contains two vertex-disjoint cycles with any given even lengths \(s\) and \(t\) provided that \(s+ t\leq n\), \(s\geq 4\), \(t\geq 4\).
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 837844
zbMATH Keywords: vertex-disjoint cycles
reviewed by: Nikolai L. Manev
MaRDI profile type: MaRDI publication profile
cites work: Pancyclic graphs. I
cites work: A method in graph theory
cites work: Some Theorems on Abstract Graphs
cites work: On maximal paths and circuits of graphs
cites work: Note on Hamilton Circuits
cites work: Partition of a bipartite graph into cycles
full work available at URL: https://doi.org/10.1007/bf01787818
OpenAlex ID: W1997341083
description: scientific article; zbMATH DE number 837844