| Display title | Quasi-bipartite graph |
| Default sort key | Quasi-Bipartite Graph |
| Page length (in bytes) | 4,476 |
| Namespace ID | 0 |
| Page ID | 240410 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Gametune |
| Date of page creation | 15:28, 6 February 2024 |
| Latest editor | imported>Gametune |
| Date of latest edit | 15:28, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In the mathematical field of graph theory, an instance of the Steiner tree problem (consisting of an undirected graph G and a set R of terminal vertices that must be connected to each other) is said to be quasi-bipartite if the non-terminal vertices in G form an independent set, i.e. if every edge is... |
