Chordal bipartite graphs and crowns (Q1071029): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Vincent Bouchitte / rank | |||
Property / reviewed by | |||
Property / reviewed by: Maciej M. Sysło / rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q39831636 / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Vincent Bouchitte / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Maciej M. Sysło / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf00334850 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2126123349 / rank | |||
Normal rank |
Latest revision as of 10:50, 30 July 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