Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits (Q1350298)
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: Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits |
scientific article; zbMATH DE number 983969
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits |
scientific article; zbMATH DE number 983969 |
Statements
Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits (English)
0 references
27 February 1997
0 references
Algorithms
0 references
Circular convex bipartite graph
0 references
Convex bipartite graph
0 references
Hamiltonian circuit
0 references
Maximum matching
0 references
0 references
