✦ LIBER ✦

Minimum rank of outerplanar graphs

✍ Scribed by John Sinkovic; Mark Kempton

Book ID: 113772242
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 435 KB
Volume: 436
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2012.01.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum dominating cycles in outerplanar

Minimum dominating cycles in outerplanar graphs

✍ Andrzej Proskurowski; Maciej M. Sysło 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 615 KB

A polynomial time algorithm for obtainin

A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs

✍ Shin-ichi Nakayama; Shigeru Masuyama 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 161 KB

Characterizations of outerplanar graphs

✍ Maciej M. Sysło 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 750 KB 👁 1 views

The paper presents several characterizations of outerp:anar graphs, some of them are counterparts of the well-known characterizations of planar graphs and the other provide very efficient tools for outerplanarity testing, coding (i.e. isomorphism testing), and counting such graphs. Finally, we attem

Pathwidth of outerplanar graphs

✍ David Coudert; Florian Huc; Jean-Sébastien Sereni 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 238 KB

## Abstract We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geo

Minimum-rank matrices with prescribed gr

Minimum-rank matrices with prescribed graph

✍ Peter M. Nylen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 752 KB

The reconstruction of outerplanar graphs

✍ William B Giles 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 746 KB 👁 1 views