✦ LIBER ✦

Graphs of separability at most 2

✍ Scribed by Ferdinando Cicalese; Martin Milanič

Book ID: 113564612
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 288 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.01.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the separability of graphs

✍ Schaudt, Oliver; Schrader, Rainer; Weil, Vera 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 267 KB

Graphs with Branchwidth at Most Three

✍ Hans L Bodlaender; Dimitrios M Thilikos 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 257 KB

In this paper we investigate both the structure of graphs with branchwidth at most three, as well as algorithms to recognise such graphs. We show that a graph has branchwidth at most three if and only if it has treewidth at most three and does not contain the three-dimensional binary cube graph as a

Packing two graphs of ordernhaving total

Packing two graphs of ordernhaving total size at most 2n− 2

✍ S. K. Teo; H. P. Yap 📂 Article 📅 1990 🏛 Springer Japan 🌐 English ⚖ 527 KB

Graphs and Separability Properties of Gr

Graphs and Separability Properties of Groups

✍ Rita Gitik 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 207 KB

A group G is LERF locally extended residually finite if for any finitely generated subgroup S of G and for any g f S there exists a finite index subgroup S of G which contains S but not g. Using graph-theoretical methods we give 0 algorithms for constructing finite index subgroups in amalgamated fre

At most single-bend embeddings of cubic

At most single-bend embeddings of cubic graphs

✍ Liu Yanpei; P. Marchioro; R. Petreschi 📂 Article 📅 1994 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 701 KB

Graphs of linear clique-width at most 3

✍ Pinar Heggernes; Daniel Meister; Charis Papadopoulos 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 428 KB