✦ LIBER ✦

Recognition of perfect elimination bipartite graphs

✍ Scribed by L. Goh; D. Rotem

Book ID: 113162474
Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 499 KB
Volume: 15
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(82)90101-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

-labeling of perfect elimination biparti

-labeling of perfect elimination bipartite graphs

✍ B.S. Panda; Preeti Goel 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 432 KB

Perfect Elimination and Chordal Bipartit

Perfect Elimination and Chordal Bipartite Graphs

✍ Martin Charles Golumbic; Clinton F. Goss 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 348 KB

## Abstract We define two types of bipartite graphs, chordal bipartite graphs and perfect elimination bipartite graphs, and prove theorems analogous to those of Dirac and Rose for chordal graphs (rigid circuit graphs, triangulated graphs). Our results are applicable to Gaussian elimination on spars

Minimum paired-dominating set in chordal

Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs

✍ Panda, B. S.; Pradhan, D. 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 571 KB

Bipartite-Perfect Graphs

✍ Van Bang Le 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 91 KB

Perfect matchings in regular bipartite g

Perfect matchings in regular bipartite graphs

✍ P. Katerinis; N. Tsikopoulos 📂 Article 📅 1996 🏛 Springer Japan 🌐 English ⚖ 356 KB

Computing a perfect edge without vertex

Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph

✍ T. Kloks; D. Kratsch 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 473 KB