Applying a condition for a Hamiltonian bipartite graph to be bipancyclic (Q686432): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:26, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Applying a condition for a Hamiltonian bipartite graph to be bipancyclic |
scientific article |
Statements
Applying a condition for a Hamiltonian bipartite graph to be bipancyclic (English)
0 references
20 December 1993
0 references
Let \(G\) denote a connected \(n\times n\) bipartite graph. The author shows, among other things, that if whenever the distance between two vertices \(x\) and \(y\) is at least \(n+1\), then \(G\) is bipartite.
0 references
Hamiltonian
0 references
bipartite graph
0 references
