Pages that link to "Item:Q4775890"
From MaRDI portal
The following pages link to Toward Characterization of Perfect Elimination Digraphs (Q4775890):
Displaying 14 items.
- Strict chordal and strict split digraphs (Q516787) (← links)
- Partitioning, tearing and modification of sparse linear systems (Q1212513) (← links)
- An algorithm for testing chordality of graphs (Q1216324) (← links)
- A note on perfect Gaussian elimination (Q1246439) (← links)
- A remark on perfect Gaussian elimination of symmetric matrices (Q1262880) (← links)
- Recognition of perfect elimination bipartite graphs (Q1836480) (← links)
- On simple characterizations of k-trees (Q1844861) (← links)
- Chordal digraphs (Q1929220) (← links)
- Chordality of locally semicomplete and weakly quasi-transitive digraphs (Q2022148) (← links)
- Digraphs of bounded elimination width (Q2442210) (← links)
- Recognizing Sparse Perfect Elimination Bipartite Graphs (Q3007647) (← links)
- Strong Chordality of Graphs with Possible Loops (Q5854465) (← links)
- Comparability digraphs: an analogue of comparability graphs (Q6177431) (← links)
- Semi-strict chordality of digraphs (Q6540642) (← links)
