Chordal bipartite graphs and crowns (Q1071029)
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: Chordal bipartite graphs and crowns |
scientific article; zbMATH DE number 3937203
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chordal bipartite graphs and crowns |
scientific article; zbMATH DE number 3937203 |
Statements
Chordal bipartite graphs and crowns (English)
0 references
1985
0 references
First, the author proves that a bipartite graph is chordal if and only if it has an elimination scheme. Then he provides a polynomial time algorithm for recognizing whether an ordered set is cycle-free.
0 references
chordal graphs
0 references
cycle-free ordered set
0 references
bipartite graph
0 references
elimination scheme
0 references
algorithm
0 references
