✦ LIBER ✦

Domination in convex and chordal bipartite graphs

✍ Scribed by Peter Damaschke; Haiko Müller; Dieter Kratsch

Book ID: 107765915
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 514 KB
Volume: 36
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90147-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Strongly chordal and chordal bipartite g

Strongly chordal and chordal bipartite graphs are

✍ Pinar Heggernes; Federico Mancini; Charis Papadopoulos; R. Sritharan 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 634 KB

Chordal bipartite graphs and crowns

✍ Vincent Bouchitté 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 178 KB

Independent domination in chordal graphs

✍ Martin Farber 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 460 KB

Domination, independent domination, and

Domination, independent domination, and duality in strongly chordal graphs

✍ Martin Farber 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 1006 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