Longest cycles in certain bipartite graphs
type: Item
instance of: scholarly article
title: Longest cycles in certain bipartite graphs
zbMATH Open document ID: 0890.05040
DOI: 10.1155/S0161171298000131
published in: International Journal of Mathematics and Mathematical Sciences
publication date: 1998-06-22T00:00:00Z
full work available at URL: https://eudml.org/doc/47884
review text: For a connected bipartite graph with bipartition \((X,Y)\), where \(|X|= n \geq m = |Y|\geq 2\), the condition ``dist\((x,y) = 3\), \(x \in X\), \(y \in Y\) implies \(d(x) + d(y) \geq n+1\)'' ensures that a cycle of length \(2m\) exists. The graph is Hamiltonian if \(m=n\).
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 1127747
zbMATH Keywords: bipartite graph
zbMATH Keywords: Hamiltonian graph
zbMATH Keywords: bipartition
zbMATH Keywords: cycle
author: Wong, Pak-ken
reviewed by: Norman F. Quimpo
MaRDI profile type: Publication
OpenAlex ID: W1983525229
description: scientific article; zbMATH DE number 1127747