| Display title | Chordal bipartite graph |
| Default sort key | Chordal bipartite graph |
| Page length (in bytes) | 8,226 |
| Namespace ID | 0 |
| Page ID | 240077 |
| 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>Sherlock |
| Date of page creation | 17:30, 6 February 2024 |
| Latest editor | imported>Sherlock |
| Date of latest edit | 17:30, 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 area of graph theory, a chordal bipartite graph is a bipartite graph B = (X,Y,E) in which every cycle of length at least 6 in B has a chord, i.e., an edge that connects two vertices that are a distance > 1 apart from each other in the cycle.
A better name would... |
