Chordal bipartite graphs and crowns (Q1071029): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Minimizing Setups for Cycle-Free Ordered Sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Perfect Elimination and Chordal Bipartite Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Stacks and splits of partially ordered sets / rank | |||
Normal rank | |||
Revision as of 10:48, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chordal bipartite graphs and crowns |
scientific article |
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
