✦ LIBER ✦

-labeling of perfect elimination bipartite graphs

✍ Scribed by B.S. Panda; Preeti Goel

Book ID: 113564598
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 432 KB
Volume: 159
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.07.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recognition of perfect elimination bipar

Recognition of perfect elimination bipartite graphs

✍ L. Goh; D. Rotem 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 499 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

The labeled perfect matching in bipartit

The labeled perfect matching in bipartite graphs

✍ Jérôme Monnot 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 148 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