✦ LIBER ✦

Bandwidth of convex bipartite graphs and related graphs

✍ Scribed by Anish Man Singh Shrestha; Satoshi Tayu; Shuichi Ueno

Book ID: 113663342
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 234 KB
Volume: 112
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2012.02.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Classes of bipartite graphs related to c

Classes of bipartite graphs related to chordal graphs

✍ Andreas Brandstädt 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 631 KB

Domination in convex and chordal biparti

Domination in convex and chordal bipartite graphs

✍ Peter Damaschke; Haiko Müller; Dieter Kratsch 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 514 KB

Minimum feedback vertex sets in cocompar

Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs

✍ Y. Daniel Liang; Maw-Shang Chang 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 165 KB

An extremal bandwidth problem for bipart

An extremal bandwidth problem for bipartite graphs

✍ Robert C. Brigham; Julie R. Carrington; Ronald D. Dutton; Joseph Fiedler; Richar 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB 👁 2 views

Convex hull of the edges of a graph and

Convex hull of the edges of a graph and near bipartite graphs

✍ J.-F Maurras 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 672 KB

Maximum matching in a convex bipartite g

Maximum matching in a convex bipartite graph

✍ Fred Glover 📂 Article 📅 1967 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB