𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the order of elimination of unknowns

✍ Scribed by V.V. Voevodin

Publisher
Elsevier Science
Year
1966
Weight
230 KB
Volume
6
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A generalization of simplicial eliminati
A generalization of simplicial elimination orderings
✍ Maffray, FrοΏ½dοΏ½ric; Porto, Oscar; Preissmann, Myriam πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 371 KB

We consider the class of graphs where every induced subgraph possesses a vertex whose neighborhood has no P4 and no 2K2. We prove that Berge's Strong Perfect Graph Conjecture holds for such graphs. The class generalizes several well-known families of perfect graphs, such as triangulated graphs and b

Perfect elimination orderings of chordal
Perfect elimination orderings of chordal powers of graphs
✍ Andreas BrandstΓ€dt; Victor D. Chepoi; Feodor F. Dragan πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 378 KB

Let G = (V,E) be a finite undirected connected graph. We show that there is a common perfect elimination ordering of all powers of G which represent chordal graphs. Consequently, if G and all of its powers are chordal then all these graphs admit a common perfect elimination ordering. Such an orderin