Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs (Q685527)
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: Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs |
scientific article; zbMATH DE number 417423
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs |
scientific article; zbMATH DE number 417423 |
Statements
Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs (English)
0 references
15 December 1993
0 references
By investigating the neighbourhood of the last pendant vertex in a one vertex extension-sequence we develop polynomial time algorithms for the problems Hamiltonian Circuit and Hamiltonian Path in (6,2)-chordal bipartite graphs.
0 references
Hamiltonian circuits
0 references
polynomial time algorithms
0 references
0 references
0.94856286
0 references
0.93048483
0 references
0.89744705
0 references
0 references
0.88935405
0 references
0.88822514
0 references
0.88822514
0 references
0.8854175
0 references
