Longest cycles in certain bipartite graphs (Q1380962)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Longest cycles in certain bipartite graphs |
scientific article; zbMATH DE number 1127747
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Longest cycles in certain bipartite graphs |
scientific article; zbMATH DE number 1127747 |
Statements
Longest cycles in certain bipartite graphs (English)
0 references
22 June 1998
0 references
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\).
0 references
bipartite graph
0 references
Hamiltonian graph
0 references
bipartition
0 references
cycle
0 references
0.8658169507980347
0 references
0.8462381362915039
0 references
